number of segments in a string

fishercoder1534 · fishercoder1534 · commit 213f60148d26 · 2016-12-04T09:19:01.000-08:00
diff --git a/EASY/src/easy/NumberofSegmentsinaString.java b/EASY/src/easy/NumberofSegmentsinaString.java
@@ -0,0 +1,29 @@
+package easy;
+/**434. Number of Segments in a String My SubmissionsBack To Contest
+
+Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.
+
+Please note that the string does not contain any non-printable characters.
+
+Example:
+
+Input: "Hello, my name is John"
+Output: 5*/
+public class NumberofSegmentsinaString {
+
+    public static int countSegments(String s) {
+        if (s == null || s.isEmpty()) return 0;
+        String[] segments = s.split(" ");
+        int count = 0;
+        for (String seg : segments){
+            if (seg.equals("")) continue;
+            count++;
+        }
+        return count;
+    }
+
+    public static void main(String...args){
+        String test = ", , , ,        a, eaefa";
+        System.out.println(countSegments(test));
+    }
+}
diff --git a/README.md b/README.md
@@ -13,6 +13,7 @@
 |438|[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/)|[Solution](../../blob/master/EASY/src/easy/FindAllAnagramsinaString.java)| O(n)|O(1) | Easy|
 |436|[Find Right Interval](https://leetcode.com/problems/find-right-interval/)|[Solution](../../blob/master/MEDIUM/src/medium/FindRightInterval.java) | O(nlogn) |O(n) | Medium| Binary Search
 |435|[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)|[Solution](../../blob/master/MEDIUM/src/medium/NonOverlappingIntervals.java) | O(nlogn) |O(1) | Medium| Greedy
+|434|[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)|[Solution](../../blob/master/EASY/src/easy/NumberofSegmentsinaString.java)| O(n)|O(1) | Easy|
 |420|[Strong Password Checker](https://leetcode.com/problems/strong-password-checker/)|[Solution](../../blob/master/HARD/src/hard/StrongPasswordChecker.java)| ? | ? | Hard| 
 |419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)|[Solution](../../blob/master/MEDIUM/src/medium/BattleshipsinaBoard.java) | O(n^2) |O(1) | Medium| DFS
 |417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)|[Solution](../../blob/master/MEDIUM/src/medium/PacificAtlanticWaterFlow.java) | O(m*n*Max(m,n)) |O(m*n) | Medium| DFS
