update: 添加问题“1784.检查二进制字符串字段”的代码(并更新其题解) (#1432)

1784: AC.cpp+py+go+java+rust (#1430) + word(en): 今日昨日

cpp - AC,5.47%,66.87%
py - AC,100.00%,40.23%
go - AC,100.00%,72.41%
java - AC,100.00%,41.57%
rust - AC,100.00%,97.06%

Signed-off-by: LetMeFly666 <Tisfy@qq.com>

Author: LetMeFly666

.commitmsg

@@ -0,0 +1,7 @@
+1784: AC.cpp+py+go+java+rust (#1430) + word(en): 今日昨日
+
+cpp - AC,5.47%,66.87%
+py - AC,100.00%,40.23%
+go - AC,100.00%,72.41%
+java - AC,100.00%,41.57%
+rust - AC,100.00%,97.06%

Codes/1784-check-if-binary-string-has-at-most-one-segment-of-ones_20260307.cpp

@@ -0,0 +1,21 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-07 13:14:24
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-07 13:14:57
+ */
+#ifdef _DEBUG
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    bool checkOnesSegment(string s) {
+        for (int i = 1; i < s.size(); i++) {
+            if (s[i] == '1' && s[i - 1] == '0') {
+                return false;
+            }
+        }
+        return true;
+    }
+};

Codes/1784-check-if-binary-string-has-at-most-one-segment-of-ones_20260307.go

@@ -0,0 +1,16 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-07 13:14:24
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-07 13:16:55
+ */
+package main
+
+func checkOnesSegment(s string) bool {
+    for i := 1; i < len(s); i++ {
+		if s[i - 1] == '0' && s[i] == '1' {
+			return false
+		}
+	}
+	return true
+}

Codes/1784-check-if-binary-string-has-at-most-one-segment-of-ones_20260307.java

@@ -0,0 +1,16 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-07 13:14:24
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-07 13:17:43
+ */
+class Solution {
+    public boolean checkOnesSegment(String s) {
+        for (int i = 1; i < s.length(); i++) {
+            if (s.charAt(i - 1) == '0' && s.charAt(i) == '1') {
+                return false;
+            }
+        }
+        return true;
+    }
+}

Codes/1784-check-if-binary-string-has-at-most-one-segment-of-ones_20260307.py

@@ -0,0 +1,9 @@
+'''
+Author: LetMeFly
+Date: 2026-03-07 13:14:24
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-03-07 13:15:44
+'''
+class Solution:
+    def checkOnesSegment(self, s: str) -> bool:
+        return '01' not in s

Codes/1784-check-if-binary-string-has-at-most-one-segment-of-ones_20260307.rs

@@ -0,0 +1,11 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-07 13:14:24
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-07 13:18:32
+ */
+impl Solution {
+    pub fn check_ones_segment(s: String) -> bool {
+        !s.contains("01")
+    }
+}

Codes/lib.rs

@@ -6,7 +6,7 @@
  */
 pub struct Solution;
 
-include!("1689-partitioning-into-minimum-number-of-deci-binary-numbers_more-rust.rs");  // 这个fileName是会被脚本替换掉的
+include!("1784-check-if-binary-string-has-at-most-one-segment-of-ones_20260307.rs");  // 这个fileName是会被脚本替换掉的
 
 #[derive(Debug, PartialEq, Eq)]
 pub struct TreeNode {

Solutions/LeetCode 1784.检查二进制字符串字段.md

@@ -114,5 +114,85 @@ public:
 };
 ```
 
+#### C++ - 手动find版本
+
+```cpp
+/*
+ * @LastEditTime: 2026-03-07 13:14:57
+ */
+class Solution {
+public:
+    bool checkOnesSegment(string s) {
+        for (int i = 1; i < s.size(); i++) {
+            if (s[i] == '1' && s[i - 1] == '0') {
+                return false;
+            }
+        }
+        return true;
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+LastEditTime: 2026-03-07 13:15:44
+'''
+class Solution:
+    def checkOnesSegment(self, s: str) -> bool:
+        return '01' not in s
+```
+
+#### Java
+
+```java
+/*
+ * @LastEditTime: 2026-03-07 13:17:43
+ */
+class Solution {
+    public boolean checkOnesSegment(String s) {
+        for (int i = 1; i < s.length(); i++) {
+            if (s.charAt(i - 1) == '0' && s.charAt(i) == '1') {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @LastEditTime: 2026-03-07 13:16:55
+ */
+package main
+
+func checkOnesSegment(s string) bool {
+    for i := 1; i < len(s); i++ {
+        if s[i - 1] == '0' && s[i] == '1' {
+            return false
+        }
+    }
+    return true
+}
+```
+
+#### Rust
+
+```rust
+/*
+ * @LastEditTime: 2026-03-07 13:18:32
+ */
+impl Solution {
+    pub fn check_ones_segment(s: String) -> bool {
+        !s.contains("01")
+    }
+}
+```
+
+
 > 同步发文于CSDN，原创不易，转载请附上[原文链接](https://blog.letmefly.xyz/2022/10/03/LeetCode%201784.%E6%A3%80%E6%9F%A5%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%AD%97%E6%AE%B5/)哦~
 > Tisfy：[https://letmefly.blog.csdn.net/article/details/127150307](https://letmefly.blog.csdn.net/article/details/127150307)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -1856,6 +1856,11 @@ categories: [自用]
 |peninsular|adj. 半岛的|
 |||
 |wrath|n. 怒火|
+|||
+|unaccommodating|adj. 不亲切的，不随和的|
+|||
+|bribery|n. 贿赂，受贿|
+|bamboo shoot|phrase. 竹笋|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)