refactor 389

Author: fishercoder1534

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

@@ -1,7 +1,11 @@
 package com.fishercoder.solutions;
-/**Given two strings s and t which consist of only lowercase letters.
+/**
+ * 389. Find the Difference
+ *
+ * Given two strings s and t which consist of only lowercase letters.
 
- String t is generated by random shuffling string s and then add one more letter at a random position.
+ String t is generated by random shuffling string s and then add
+ one more letter at a random position.
 
  Find the letter that was added in t.
 
@@ -14,25 +18,27 @@
  Output:
  e
 
- Explanation:
- 'e' is the letter that was added.*/
+ Explanation: 'e' is the letter that was added.*/
+
 public class _389 {
-    public char findTheDifference(String s, String t) {
-        int[] counts = new int[128];
-        char[] schars = s.toCharArray();
-        char[] tchars = t.toCharArray();
-        for (int i = 0; i < schars.length; i++) {
-            counts[schars[i]]++;
-        }
-        for (int i = 0; i < tchars.length; i++) {
-            counts[tchars[i]]--;
-        }
-        char result = 'a';
-        for (int i = 0; i < 128; i++) {
-            if (counts[i] != 0) {
-                result = (char) i;
+    public static class Solution1 {
+        public char findTheDifference(String s, String t) {
+            int[] counts = new int[128];
+            char[] schars = s.toCharArray();
+            char[] tchars = t.toCharArray();
+            for (int i = 0; i < schars.length; i++) {
+                counts[schars[i]]++;
+            }
+            for (int i = 0; i < tchars.length; i++) {
+                counts[tchars[i]]--;
+            }
+            char result = 'a';
+            for (int i = 0; i < 128; i++) {
+                if (counts[i] != 0) {
+                    result = (char) i;
+                }
             }
+            return result;
         }
-        return result;
     }
 }