refactor 151

fishercoder1534 · fishercoder1534 · commit 702358deec2c · 2020-07-15T08:10:07.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_151.java b/src/main/java/com/fishercoder/solutions/_151.java
@@ -3,46 +3,28 @@
 import java.util.ArrayDeque;
 import java.util.Deque;
 
-/**
- * 151. Reverse Words in a String
-
-  Given an input string, reverse the string word by word.
-  For example,
-  Given s = "the sky is blue",
-  return "blue is sky the".
-
- Clarification:
-
- What constitutes a word?
- A sequence of non-space characters constitutes a word.
- Could the input string contain leading or trailing spaces?
- Yes. However, your reversed string should not contain leading or trailing spaces.
- How about multiple spaces between two words?
- Reduce them to a single space in the reversed string.
- */
-
 public class _151 {
-  public static class Solution1 {
-    public String reverseWords(String s) {
-      s.trim();
-      if (s == null || s.length() == 0) {
-        return "";
-      }
-      String[] words = s.split(" ");
-      if (words == null || words.length == 0) {
-        return "";
-      }
-      Deque<String> stack = new ArrayDeque<>();
-      for (String word : words) {
-        if (!word.equals("")) {
-          stack.offer(word);
+    public static class Solution1 {
+        public String reverseWords(String s) {
+            s.trim();
+            if (s == null || s.length() == 0) {
+                return "";
+            }
+            String[] words = s.split(" ");
+            if (words == null || words.length == 0) {
+                return "";
+            }
+            Deque<String> stack = new ArrayDeque<>();
+            for (String word : words) {
+                if (!word.equals("")) {
+                    stack.offer(word);
+                }
+            }
+            StringBuilder stringBuilder = new StringBuilder();
+            while (!stack.isEmpty()) {
+                stringBuilder.append(stack.pollLast()).append(" ");
+            }
+            return stringBuilder.substring(0, stringBuilder.length() - 1).toString();
         }
-      }
-      StringBuilder stringBuilder = new StringBuilder();
-      while (!stack.isEmpty()) {
-        stringBuilder.append(stack.pollLast()).append(" ");
-      }
-      return stringBuilder.substring(0, stringBuilder.length() - 1).toString();
     }
-  }
 }
