Update 434 solution

halfrost · dezhiy · commit 219c53bb0328 · 2021-10-08T19:58:15.000-07:00
diff --git a/README.md b/README.md
diff --git a/leetcode/0434.Number-of-Segments-in-a-String/README.md b/leetcode/0434.Number-of-Segments-in-a-String/README.md
@@ -1,4 +1,4 @@
-# [434. Number of Segments in a String](https://leetcode-cn.com/problems/number-of-segments-in-a-string/)
+# [434. Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)
 
 
 ## 题目
@@ -43,3 +43,28 @@ A segment is defined to be a contiguous sequence of non-space characters.
 ## 解题思路
 
 - 以空格为分割计算元素个数
+
+## 代码
+
+```go
+
+package leetcode
+
+func countSegments(s string) int {
+	segments := false
+	cnt := 0
+	for _, v := range s {
+		if v == ' ' && segments {
+			segments = false
+			cnt += 1
+		} else if v != ' ' {
+			segments = true
+		}
+	}
+	if segments {
+		cnt++
+	}
+	return cnt
+}
+
+```
diff --git a/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md b/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md
@@ -186,5 +186,5 @@ func convert(gene string) uint32 {
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal/">⬅️上一页</a></p>
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0435.Non-overlapping-Intervals/">下一页➡️</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String/">下一页➡️</a></p>
 </div>
diff --git a/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md b/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md
@@ -0,0 +1,77 @@
+# [434. Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)
+
+
+## 题目
+
+You are given a string s, return the number of segments in the string.
+
+A segment is defined to be a contiguous sequence of non-space characters.
+
+**Example 1:**
+
+    Input: s = "Hello, my name is John"
+    Output: 5
+    Explanation: The five segments are ["Hello,", "my", "name", "is", "John"]
+
+**Example 2:**
+
+    Input: s = "Hello"
+    Output: 1
+
+**Example 3:**
+
+    Input: s = "love live! mu'sic forever"
+    Output: 4
+
+**Example 4:**
+
+    Input: s = ""
+    Output: 0
+
+**Constraints**
+
+ - 0 <= s.length <= 300
+ - s consists of lower-case and upper-case English letters, digits or one of the following characters "!@#$%^&*()_+-=',.:".
+ - The only space character in s is ' '.
+
+## 题目大意
+
+统计字符串中的单词个数，这里的单词指的是连续的不是空格的字符。
+
+请注意，你可以假定字符串里不包括任何不可打印的字符。
+
+## 解题思路
+
+- 以空格为分割计算元素个数
+
+## 代码
+
+```go
+
+package leetcode
+
+func countSegments(s string) int {
+	segments := false
+	cnt := 0
+	for _, v := range s {
+		if v == ' ' && segments {
+			segments = false
+			cnt += 1
+		} else if v != ' ' {
+			segments = true
+		}
+	}
+	if segments {
+		cnt++
+	}
+	return cnt
+}
+
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0435.Non-overlapping-Intervals/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md b/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md
@@ -137,6 +137,6 @@ func eraseOverlapIntervals1(intervals [][]int) int {
 
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String/">⬅️上一页</a></p>
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0436.Find-Right-Interval/">下一页➡️</a></p>
 </div>
diff --git a/website/content/ChapterTwo/Array.md b/website/content/ChapterTwo/Array.md
