update: 添加问题“1295.统计位数为偶数的数字”的代码和题解(#907)

LetMeFly666 · LetMeFly666 · commit 0b5a1edae4c4 · 2025-04-30T17:52:22.000+08:00
Signed-off-by: LetMeFly666 &lt;814114971@qq.com&gt;
diff --git a/Codes/1295-find-numbers-with-even-number-of-digits.cpp b/Codes/1295-find-numbers-with-even-number-of-digits.cpp
@@ -0,0 +1,29 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-30 17:23:40
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-30 17:25:14
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    inline int getLength(int t) {
+        int ans = 0;
+        while (t) {
+            ans++;
+            t /= 10;
+        }
+        return ans;
+    }
+public:
+    int findNumbers(vector<int>& nums) {
+        int ans = 0;
+        for (int t : nums) {
+            ans += getLength(t) % 2 == 0;
+        }
+        return ans;
+    }
+};
diff --git a/Codes/1295-find-numbers-with-even-number-of-digits.go b/Codes/1295-find-numbers-with-even-number-of-digits.go
@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-30 17:24:40
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-30 17:28:26
+ */
+func findNumbers(nums []int) (ans int) {
+    for _, t := range nums {
+		cnt := 0
+		for t > 0 {
+			cnt++
+			t /= 10
+		}
+		if cnt % 2 == 0 {
+			ans++
+		}
+	}
+	return
+}
diff --git a/Codes/1295-find-numbers-with-even-number-of-digits.java b/Codes/1295-find-numbers-with-even-number-of-digits.java
@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-30 17:24:37
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-30 17:27:07
+ */
+class Solution {
+    private int getLength(int t) {
+        int ans = 0;
+        while (t > 0) {
+            ans++;
+            t /= 10;
+        }
+        return ans;
+    }
+    public int findNumbers(int[] nums) {
+        int ans = 0;
+        for (int t : nums) {
+            if (getLength(t) % 2 == 0) {
+                ans++;
+            }
+        }
+        return ans;
+    }
+}
diff --git a/Codes/1295-find-numbers-with-even-number-of-digits.py b/Codes/1295-find-numbers-with-even-number-of-digits.py
@@ -0,0 +1,11 @@
+'''
+Author: LetMeFly
+Date: 2025-04-30 17:24:34
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-30 17:26:24
+'''
+from typing import List
+
+class Solution:
+    def findNumbers(self, nums: List[int]) -> int:
+        return sum(len(str(t)) % 2 == 0 for t in nums)
diff --git a/Codes/1295-find-numbers-with-even-number-of-digits_method2.cpp b/Codes/1295-find-numbers-with-even-number-of-digits_method2.cpp
@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-30 17:30:12
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-30 17:30:19
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int findNumbers(vector<int>& nums) {
+        int ans = 0;
+        for (int t : nums) {
+            while (t >= 10) {
+                t /= 100;
+            }
+            ans += t == 0;
+        }
+        return ans;
+    }
+};
diff --git a/README.md b/README.md
@@ -503,6 +503,7 @@
 |1282.用户分组|中等|<a href="https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/12/LeetCode%201282.%E7%94%A8%E6%88%B7%E5%88%86%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126298148" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/solution/letmefly-1282yong-hu-fen-zu-by-tisfy-9h94/" target="_blank">LeetCode题解</a>|
 |1287.有序数组中出现次数超过25%的元素|简单|<a href="https://leetcode.cn/problems/element-appearing-more-than-25-in-sorted-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/17/LeetCode%201287.%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%8725%E7%9A%84%E5%85%83%E7%B4%A0" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145683090" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/element-appearing-more-than-25-in-sorted-array/solutions/3078136/letmefly-1287you-xu-shu-zu-zhong-chu-xia-wdat/" target="_blank">LeetCode题解</a>|
 |1289.下降路径最小和II|困难|<a href="https://leetcode.cn/problems/minimum-falling-path-sum-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/08/10/LeetCode%201289.%E4%B8%8B%E9%99%8D%E8%B7%AF%E5%BE%84%E6%9C%80%E5%B0%8F%E5%92%8CII/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/132201281" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-falling-path-sum-ii/solutions/2381173/letmefly-1289xia-jiang-lu-jing-zui-xiao-kt8cj/" target="_blank">LeetCode题解</a>|
+|1295.统计位数为偶数的数字|简单|<a href="https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/30/LeetCode%201295.%E7%BB%9F%E8%AE%A1%E4%BD%8D%E6%95%B0%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E6%95%B0%E5%AD%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147637587" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/solutions/3666390/letmefly-1295tong-ji-wei-shu-wei-ou-shu-bwhfr/" target="_blank">LeetCode题解</a>|
 |1299.将每个元素替换为右侧最大元素|简单|<a href="https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/16/LeetCode%201299.%E5%B0%86%E6%AF%8F%E4%B8%AA%E5%85%83%E7%B4%A0%E6%9B%BF%E6%8D%A2%E4%B8%BA%E5%8F%B3%E4%BE%A7%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145661909" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/solutions/3076497/letmefly-1299jiang-mei-ge-yuan-su-ti-hua-4y58/" target="_blank">LeetCode题解</a>|
 |1302.层数最深叶子节点的和|中等|<a href="https://leetcode.cn/problems/deepest-leaves-sum/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/17/LeetCode%201302.%E5%B1%82%E6%95%B0%E6%9C%80%E6%B7%B1%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E7%9A%84%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126377912" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/deepest-leaves-sum/solution/letmefly-1302ceng-shu-zui-shen-xie-zi-ji-eyu0/" target="_blank">LeetCode题解</a>|
 |1328.破坏回文串|中等|<a href="https://leetcode.cn/problems/break-a-palindrome/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/05/LeetCode%201328.%E7%A0%B4%E5%9D%8F%E5%9B%9E%E6%96%87%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146046025" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/break-a-palindrome/solutions/3597648/letmefly-1328po-pi-hui-wen-chuan-tan-xin-ktbc/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 1295.统计位数为偶数的数字.md b/Solutions/LeetCode 1295.统计位数为偶数的数字.md
@@ -0,0 +1,210 @@
+---
+title: 1295.统计位数为偶数的数字：模拟
+date: 2025-04-30 17:33:51
+tags: [题解, LeetCode, 简单, 数组, 数学]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】1295.统计位数为偶数的数字：模拟
+
+力扣题目链接：[https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/](https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/)
+
+<p>给你一个整数数组&nbsp;<code>nums</code>，请你返回其中位数为&nbsp;<strong>偶数</strong>&nbsp;的数字的个数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [12,345,2,6,7896]
+<strong>输出：</strong>2
+<strong>解释：
+</strong>12 是 2 位数字（位数为偶数）&nbsp;
+345 是 3 位数字（位数为奇数）&nbsp;&nbsp;
+2 是 1 位数字（位数为奇数）&nbsp;
+6 是 1 位数字 位数为奇数）&nbsp;
+7896 是 4 位数字（位数为偶数）&nbsp;&nbsp;
+因此只有 12 和 7896 是位数为偶数的数字
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [555,901,482,1771]
+<strong>输出：</strong>1 
+<strong>解释： </strong>
+只有 1771 是位数为偶数的数字。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 500</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+
+    
+## 解题方法一：正常模拟
+
+如何判断一个(非负)数在十进制下有多少位？
+
+> 当这个数不为0时拿这个数不断除以10，并将“数字位数”加一。
+
+依次计算每个元素的位数，判断是否是偶数。
+
+### 时空复杂度分析
+
++ 时间复杂度$O(len(nums)\times \log nums[i])$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-30 17:23:40
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-30 17:25:14
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    inline int getLength(int t) {
+        int ans = 0;
+        while (t) {
+            ans++;
+            t /= 10;
+        }
+        return ans;
+    }
+public:
+    int findNumbers(vector<int>& nums) {
+        int ans = 0;
+        for (int t : nums) {
+            ans += getLength(t) % 2 == 0;
+        }
+        return ans;
+    }
+};
+```
+
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-04-30 17:24:34
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-30 17:26:24
+'''
+from typing import List
+
+class Solution:
+    def findNumbers(self, nums: List[int]) -> int:
+        return sum(len(str(t)) % 2 == 0 for t in nums)
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-30 17:24:37
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-30 17:27:07
+ */
+class Solution {
+    private int getLength(int t) {
+        int ans = 0;
+        while (t > 0) {
+            ans++;
+            t /= 10;
+        }
+        return ans;
+    }
+    public int findNumbers(int[] nums) {
+        int ans = 0;
+        for (int t : nums) {
+            if (getLength(t) % 2 == 0) {
+                ans++;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-30 17:24:40
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-30 17:28:26
+ */
+func findNumbers(nums []int) (ans int) {
+    for _, t := range nums {
+		cnt := 0
+		for t > 0 {
+			cnt++
+			t /= 10
+		}
+		if cnt % 2 == 0 {
+			ans++
+		}
+	}
+	return
+}
+```
+
+## 解题方法二：一次移除两位
+
+方法一中我们将元素一次除以10（移除元素的一位），但是问题求的是“元素位数是否为偶数”，那么我们为什么不可以在元素位数大于等于2的时候，一次移除两位呢？最后看元素剩下一位还是零位不就知道元素十进制下的位数是奇数还是偶数了吗。
+
+### 时空复杂度分析
+
++ 时间复杂度$O(len(nums)\times \log nums[i])$
++ 空间复杂度$O(1)$
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-30 17:30:12
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-30 17:30:19
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int findNumbers(vector<int>& nums) {
+        int ans = 0;
+        for (int t : nums) {
+            while (t >= 10) {
+                t /= 100;
+            }
+            ans += t == 0;
+        }
+        return ans;
+    }
+};
+```
+
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/147637587)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/04/30/LeetCode%201295.%E7%BB%9F%E8%AE%A1%E4%BD%8D%E6%95%B0%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E6%95%B0%E5%AD%97/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -1099,7 +1099,7 @@ categories: [自用]
 |||
 |wordy|adj. 话多的，冗长的，啰嗦的|
 |oceanography|n. 海洋学|
-|stronghold|n. 要塞，据点，堡垒，有广泛支持的地方|
+|<font color="#28bea0" title="二次复习">stronghold</font>|n. 要塞，据点，堡垒，有广泛支持的地方|
 |mackintosh|n. 防水胶布，胶布雨衣（麦金托什）|
 |||
 |ferrous|adj. 含铁的，铁的|
@@ -1123,6 +1123,8 @@ categories: [自用]
 |lining|n. 内衬，衬层，衬里|
 |||
 |cape|n. 岬，海角；披肩，披风，短斗篷|
+|||
+|nought|n. 无，零|
 
 <p class="wordCounts">单词收录总数</p>
 
