edit 251

fishercoder1534 · fishercoder1534 · commit e2302aad7ba7 · 2017-07-25T11:35:32.000-07:00
diff --git a/README.md b/README.md
@@ -338,7 +338,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |254|[Factor Combinations](https://leetcode.com/problems/factor-combinations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FactorCombinations.java) | O(nlogn) | O(nlogn) | Medium| Backtracking
 |253|[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_253.java) | O(nlogn) | O(h) | Medium| Heap
 |252|[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MeetingRooms.java) | O(nlogn) | O(1) | Easy
-|251|[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/)|[Solution](../master/src/main/java/com/fishercoder/solutions/Flatten2DVector.java)| O(1)|O(m*n) | Medium| 
+|251|[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_251.java)| O(1)|O(m*n) | Medium| 
 |250|[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_250.java)| O(n)|O(h) | Medium| DFS
 |249|[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/GroupShiftedStrings.java) | O(nlogn) | O(n) | 
 |248|[Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_248.java) | O(?) | O(?) | Hard | Recursion, DFS 
diff --git a/src/main/java/com/fishercoder/solutions/_251.java b/src/main/java/com/fishercoder/solutions/_251.java
@@ -30,7 +30,7 @@ Not sure? Think about how you would implement hasNext(). Which is more complex?
  Follow up:
  As an added challenge, try to code it using only iterators in C++ or iterators in Java.*/
 
-public class Flatten2DVector {
+public class _251 {
 
     class Vector2D implements Iterator<Integer> {
         private Queue<Integer> cache;
