refactor 434

Author: fishercoder1534

README.md

@@ -354,7 +354,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_437.java) | O(n^2) |O(n) | |Easy| DFS, recursion
 |436|[Find Right Interval](https://leetcode.com/problems/find-right-interval/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_436.java) | O(nlogn) |O(n) | |Medium| Binary Search
 |435|[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_435.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](../master/src/main/java/com/fishercoder/solutions/NumberofSegmentsinaString.java)| O(n)|O(1) | |Easy|
+|434|[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_434.java)| O(n)|O(1) | |Easy|
 |432|[All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_432.java)| O(1)|O(n) | |Hard| Design
 |429|[N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_429.java)| O(n)|O(n) | |Easy| BFS, Tree
 |425|[Word Squares](https://leetcode.com/problems/word-squares/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_425.java)| O(n!)|O(n) | |Hard| Trie, Backtracking, Recursion

src/main/java/com/fishercoder/solutions/_434.java

@@ -1,28 +1,32 @@
 package com.fishercoder.solutions;
-/**434. Number of Segments in a String
-
-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.
+/**
+ * 434. Number of Segments in a String
+ *
+ * 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 _434 {
 
-    public 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;
+    public static class Solution1 {
+        public 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++;
             }
-            count++;
+            return count;
         }
-        return count;
     }
 }

src/test/java/com/fishercoder/_434Test.java

@@ -8,35 +8,35 @@
 import static junit.framework.Assert.assertEquals;
 
 public class _434Test {
-    private static _434 test;
-    private static int expected;
-    private static int actual;
-    private static String s;
+  private static _434.Solution1 solution1;
+  private static int expected;
+  private static int actual;
+  private static String s;
 
-    @BeforeClass
-    public static void setup() {
-        test = new _434();
-    }
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _434.Solution1();
+  }
 
-    @Before
-    public void setupForEachTest() {
-        expected = 0;
-        actual = 0;
-    }
+  @Before
+  public void setupForEachTest() {
+    expected = 0;
+    actual = 0;
+  }
 
-    @Test
-    public void test1() {
-        s = "Hello, my name is John";
-        expected = 5;
-        actual = test.countSegments(s);
-        assertEquals(expected, actual);
-    }
+  @Test
+  public void test1() {
+    s = "Hello, my name is John";
+    expected = 5;
+    actual = solution1.countSegments(s);
+    assertEquals(expected, actual);
+  }
 
-    @Test
-    public void test2() {
-        s = ", , , ,        a, eaefa";
-        expected = 6;
-        actual = test.countSegments(s);
-        assertEquals(expected, actual);
-    }
+  @Test
+  public void test2() {
+    s = ", , , ,        a, eaefa";
+    expected = 6;
+    actual = solution1.countSegments(s);
+    assertEquals(expected, actual);
+  }
 }