add 796

fishercoder1534 · fishercoder1534 · commit dbe3e86bf58c · 2018-03-11T08:00:58.000-07:00
diff --git a/README.md b/README.md
@@ -22,6 +22,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|796|[Rotate String](https://leetcode.com/problems/rotate-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_796.java) | O(n) | O(1) | |Easy|
 |791|[Custom Sort String](https://leetcode.com/problems/custom-sort-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_791.java) | O(n+m) | O(1) | |Medium|
 |788|[Rotated Digits](https://leetcode.com/problems/rotated-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_788.java) | O(n*m) | O(1) | |Easy|
 |784|[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_784.java) | O(n*2^n) | O(n*2^n) | |Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_796.java b/src/main/java/com/fishercoder/solutions/_796.java
@@ -0,0 +1,36 @@
+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;
+        }
+      }
+      return false;
+    }
+  }
+}
diff --git a/src/test/java/com/fishercoder/_796Test.java b/src/test/java/com/fishercoder/_796Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._796;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _796Test {
+  private static _796.Solution1 solution1;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _796.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    assertEquals(true, solution1.rotateString("abcde", "cdeab"));
+  }
+
+  @Test
+  public void test2() {
+    assertEquals(false, solution1.rotateString("abcde", "abced"));
+  }
+}
