edit 396

fishercoder1534 · fishercoder1534 · commit ea37bb282f06 · 2017-07-24T18:41:57.000-07:00
diff --git a/README.md b/README.md
@@ -203,7 +203,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |399|[Evaluate Division](https://leetcode.com/problems/evaluate-division/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_399.java)| O(n*n!)|O(n) | Medium| Graph, DFS, Backtracking
 |398|[Random Pick Index](https://leetcode.com/problems/random-pick-index/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_398.java) | | | Medium| Reservoir Sampling
 |397|[Integer Replacement](https://leetcode.com/problems/integer-replacement/)|[Solution](../master/src/main/java/com/fishercoder/solutions/IntegerReplacement.java)| ? | ? | Easy| BFS
-|396|[Rotate Function](https://leetcode.com/problems/rotate-function/)|[Solution](../master/src/main/java/com/fishercoder/solutions/RotateFunction.java)| O(n^2) could be optimized to O(n) | O(1) | Easy|
+|396|[Rotate Function](https://leetcode.com/problems/rotate-function/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_396.java)| O(n^2) could be optimized to O(n) | O(1) | Easy|
 |393|[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_393.java)| O(?)|O(?) | Medium| Bit Manipulation
 |392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_392.java)| O(m*n)|O(1) | Medium| Array, String
 |390|[Elimination Game](https://leetcode.com/problems/elimination-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/EliminationGame.java)| O(logn)|O(1) | Medium|
diff --git a/src/main/java/com/fishercoder/solutions/_396.java b/src/main/java/com/fishercoder/solutions/_396.java
@@ -22,7 +22,7 @@ Calculate the maximum value of F(0), F(1), ..., F(n-1).
 
  So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.*/
 //F(k) = 0 * Bk[0] + 1 * Bk[1] + ... + (n-1) * Bk[n-1]
-public class RotateFunction {
+public class _396 {
     public int maxRotateFunction(int[] A) {
         if(A == null || A.length == 0) return 0;
         int[] F = new int[A.length];
@@ -55,7 +55,7 @@ private int[] rotate(int[] a) {
     
     public static void main(String...strings){
         int[] nums = new int[]{4, 3, 2, 6};
-        RotateFunction test = new RotateFunction();
+        _396 test = new _396();
         System.out.println(test.maxRotateFunction(nums));
     }
 }
