refactor 796

fishercoder1534 · fishercoder1534 · commit d0565fecef7e · 2020-07-23T10:35:16.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_796.java b/src/main/java/com/fishercoder/solutions/_796.java
@@ -1,36 +1,17 @@
 package com.fishercoder.solutions;
 
-/**
- * 796. Rotate String
-
- We are given two strings, A and B.
-
- A shift on A consists of taking string A and moving the leftmost character to the rightmost position. For example, if A = 'abcde', then it will be 'bcdea' after one shift on A. Return True if and only if A can become B after some number of shifts on A.
-
- Example 1:
- Input: A = 'abcde', B = 'cdeab'
- Output: true
-
- Example 2:
- Input: A = 'abcde', B = 'abced'
- Output: false
-
- Note:
-
- A and B will have length at most 100.
- */
 public class _796 {
-  public static class Solution1 {
-    public boolean rotateString(String A, String B) {
-      if (A.length() != B.length()) {
-        return false;
-      }
-      for (int i = 0; i < A.length(); i++) {
-        if ((A.substring(i) + A.substring(0, i)).equals(B)) {
-          return true;
+    public static class Solution1 {
+        public boolean rotateString(String A, String B) {
+            if (A.length() != B.length()) {
+                return false;
+            }
+            for (int i = 0; i < A.length(); i++) {
+                if ((A.substring(i) + A.substring(0, i)).equals(B)) {
+                    return true;
+                }
+            }
+            return false;
         }
-      }
-      return false;
     }
-  }
 }
