update: 添加问题“1523.在区间范围内统计奇数数目”的代码和题解 + test newSolutions.py(remove header) + test Tisfy on WindowsG3 (#1399)

1523: AC.cpp (#1261)(#1399)

cpp - AC,100.00%,62.72%
py - AC,100.00%,7.10%
go - AC,100.00%,65.85%
java - AC,100.00%,68.02%
rust - AC,100.00%,13.30%

Signed-off-by: Tisfy <Tisfy@foxmail.com>

Author: Tisfy

.commitTitleExtra

@@ -0,0 +1 @@
+ + test newSolutions.py(remove header) + test Tisfy on WindowsG3

.commitmsg

@@ -0,0 +1,7 @@
+1523: AC.cpp (#1261)(#1399)
+
+cpp - AC,100.00%,62.72%
+py - AC,100.00%,7.10%
+go - AC,100.00%,65.85%
+java - AC,100.00%,68.02%
+rust - AC,100.00%,13.30%

Codes/1523-count-odd-numbers-in-an-interval-range_20260219.cpp

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-19 17:38:02
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-19 17:39:31
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int countOdds(int low, int high) {
+        if (low % 2) {
+            low--;
+        }
+        if (high % 2) {
+            high++;
+        }
+        return (high - low) >> 1;
+    }
+};

Codes/1523-count-odd-numbers-in-an-interval-range_20260219.go

@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-19 17:59:08
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-19 18:02:40
+ */
+package main
+
+func countOdds(low int, high int) int {
+    if low % 2 == 1 {
+        low--
+    }
+    if high % 2 == 1 {
+        high++
+    }
+    return (high - low) / 2
+}

Codes/1523-count-odd-numbers-in-an-interval-range_20260219.java

@@ -0,0 +1,11 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-19 17:59:08
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-19 18:04:04
+ */
+class Solution {
+    public int countOdds(int low, int high) {
+        return (high + 1) / 2 - low / 2;
+    }
+}

Codes/1523-count-odd-numbers-in-an-interval-range_20260219.py

@@ -0,0 +1,13 @@
+'''
+Author: LetMeFly
+Date: 2026-02-19 17:59:08
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-02-19 18:00:11
+'''
+class Solution:
+    def countOdds(self, low: int, high: int) -> int:
+        if low % 2:
+            low -= 1
+        if high % 2:
+            high += 1
+        return (high - low) // 2

Codes/1523-count-odd-numbers-in-an-interval-range_20260219.rs

@@ -0,0 +1,11 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-19 17:59:08
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-19 18:06:07
+ */
+impl Solution {
+    pub fn count_odds(low: i32, high: i32) -> i32 {
+        (high + 1) / 2 - low / 2
+    }
+}

Codes/lib.rs

@@ -6,7 +6,7 @@
  */
 pub struct Solution;
 
-include!("0696-count-binary-substrings.rs");  // 这个fileName是会被脚本替换掉的
+include!("1523-count-odd-numbers-in-an-interval-range_20260219.rs");  // 这个fileName是会被脚本替换掉的
 
 #[derive(Debug, PartialEq, Eq)]
 pub struct TreeNode {

README.md

@@ -598,6 +598,7 @@
 |1488.避免洪水泛滥|中等|<a href="https://leetcode.cn/problems/avoid-flood-in-the-city/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/10/13/LeetCode%201488.%E9%81%BF%E5%85%8D%E6%B4%AA%E6%B0%B4%E6%B3%9B%E6%BB%A5/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/133809999" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/avoid-flood-in-the-city/solutions/2480771/letmefly-1488bi-mian-hong-shui-fan-lan-h-yxx5/" target="_blank">LeetCode题解</a>|
 |1491.去掉最低工资和最高工资后的工资平均值|简单|<a href="https://leetcode.cn/problems/average-salary-excluding-the-minimum-and-maximum-salary/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/03/LeetCode%201491.%E5%8E%BB%E6%8E%89%E6%9C%80%E4%BD%8E%E5%B7%A5%E8%B5%84%E5%92%8C%E6%9C%80%E9%AB%98%E5%B7%A5%E8%B5%84%E5%90%8E%E7%9A%84%E5%B7%A5%E8%B5%84%E5%B9%B3%E5%9D%87%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/138416153" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/average-salary-excluding-the-minimum-and-maximum-salary/solutions/2764238/letmefly-1491qu-diao-zui-di-gong-zi-he-z-8h25/" target="_blank">LeetCode题解</a>|
 |1499.满足不等式的最大值|困难|<a href="https://leetcode.cn/problems/max-value-of-equation/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/07/21/LeetCode%201499.%E6%BB%A1%E8%B6%B3%E4%B8%8D%E7%AD%89%E5%BC%8F%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131844105" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/max-value-of-equation/solutions/2352476/letmefly-1499man-zu-bu-deng-shi-de-zui-d-wlzu/" target="_blank">LeetCode题解</a>|
+|1523.在区间范围内统计奇数数目|简单|<a href="https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/02/19/LeetCode%201523.%E5%9C%A8%E5%8C%BA%E9%97%B4%E8%8C%83%E5%9B%B4%E5%86%85%E7%BB%9F%E8%AE%A1%E5%A5%87%E6%95%B0%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/158209747" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/solutions/3904901/letmefly-1523zai-qu-jian-fan-wei-nei-ton-jquc/" target="_blank">LeetCode题解</a>|
 |1534.统计好三元组|简单|<a href="https://leetcode.cn/problems/count-good-triplets/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/15/LeetCode%201534.%E7%BB%9F%E8%AE%A1%E5%A5%BD%E4%B8%89%E5%85%83%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147249275" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-good-triplets/solutions/3651795/letmefly-1534tong-ji-hao-san-yuan-zu-xi-dv8dw/" target="_blank">LeetCode题解</a>|
 |1535.找出数组游戏的赢家|中等|<a href="https://leetcode.cn/problems/find-the-winner-of-an-array-game/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/19/LeetCode%201535.%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E6%B8%B8%E6%88%8F%E7%9A%84%E8%B5%A2%E5%AE%B6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139040126" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-winner-of-an-array-game/solutions/2782688/letmefly-1535zhao-chu-shu-zu-you-xi-de-y-ff3w/" target="_blank">LeetCode题解</a>|
 |1542.找出最长的超赞子字符串|困难|<a href="https://leetcode.cn/problems/find-longest-awesome-substring/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/20/LeetCode%201542.%E6%89%BE%E5%87%BA%E6%9C%80%E9%95%BF%E7%9A%84%E8%B6%85%E8%B5%9E%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139077950" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-longest-awesome-substring/solutions/2784697/letmefly-1542zhao-chu-zui-chang-de-chao-16nco/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 1523.在区间范围内统计奇数数目.md

@@ -0,0 +1,147 @@
+---
+title: 1523.在区间范围内统计奇数数目：两种方法O(1)算
+date: 2026-02-19 18:19:46
+tags: [题解, LeetCode, 简单, 数学]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】1523.在区间范围内统计奇数数目：两种方法O(1)算
+
+力扣题目链接：[https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/](https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/)
+
+<p>给你两个非负整数&nbsp;<code>low</code> 和&nbsp;<code>high</code>&nbsp;。请你返回<em>&nbsp;</em><code>low</code><em> </em>和<em>&nbsp;</em><code>high</code><em>&nbsp;</em>之间（包括二者）奇数的数目。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>low = 3, high = 7
+<strong>输出：</strong>3
+<strong>解释：</strong>3 到 7 之间奇数数字为 [3,5,7] 。</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>low = 8, high = 10
+<strong>输出：</strong>1
+<strong>解释：</strong>8 到 10 之间奇数数字为 [9] 。</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>0 &lt;= low &lt;= high&nbsp;&lt;= 10^9</code></li>
+</ul>
+
+
+    
+## 解题方法一：思考容易写着麻烦点
+
+low和high都是偶数的示例 2：low = 8, high = 10，中间共有几个奇数？
+
+答案是$\frac{10-8}2$个。
+
+如果low是奇数，那么我们令low-1；如果high是奇数，那么我们就令high+1就好了。
+
++ 时间复杂度$O(1)$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2026-02-19 17:39:31
+ */
+class Solution {
+public:
+    int countOdds(int low, int high) {
+        if (low % 2) {
+            low--;
+        }
+        if (high % 2) {
+            high++;
+        }
+        return (high - low) >> 1;
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+LastEditTime: 2026-02-19 18:00:11
+'''
+class Solution:
+    def countOdds(self, low: int, high: int) -> int:
+        if low % 2:
+            low -= 1
+        if high % 2:
+            high += 1
+        return (high - low) // 2
+```
+
+#### Go
+
+```go
+/*
+ * @LastEditTime: 2026-02-19 18:02:40
+ */
+package main
+
+func countOdds(low int, high int) int {
+    if low % 2 == 1 {
+        low--
+    }
+    if high % 2 == 1 {
+        high++
+    }
+    return (high - low) / 2
+}
+```
+
+## 解题方法二：思考麻烦点写着容易
+
+不论一个数的奇偶性：
+
+* $[1, low)$ 共有几个奇数？答案是$\lfloor\frac{low}2\rfloor$个；
+* $[1, high]$ 共有几个奇数？答案是$\lfloor\frac{high+1}2\rfloor$个。
+
+那么 $[low, high]$ 共有几个奇数？ $[1, high] - [1, low)$ 即为所得。
+
++ 时间复杂度$O(1)$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### Java
+
+```java
+/*
+ * @LastEditTime: 2026-02-19 18:04:04
+ */
+class Solution {
+    public int countOdds(int low, int high) {
+        return (high + 1) / 2 - low / 2;
+    }
+}
+```
+
+#### Rust
+
+```rust
+/*
+ * @LastEditTime: 2026-02-19 18:06:07
+ */
+impl Solution {
+    pub fn count_odds(low: i32, high: i32) -> i32 {
+        (high + 1) / 2 - low / 2
+    }
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/158209747)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2026/02/19/LeetCode%201523.%E5%9C%A8%E5%8C%BA%E9%97%B4%E8%8C%83%E5%9B%B4%E5%86%85%E7%BB%9F%E8%AE%A1%E5%A5%87%E6%95%B0%E6%95%B0%E7%9B%AE/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)