edit 417

fishercoder1534 · fishercoder1534 · commit d3e9bff7877e · 2017-07-24T18:55:04.000-07:00
diff --git a/README.md b/README.md
@@ -184,7 +184,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |420|[Strong Password Checker](https://leetcode.com/problems/strong-password-checker/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_420.java)| ? | ? | Hard| 
 |419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_419.java) | O(m*n) |O(1) | Medium| DFS
 |418|[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_418.java) | O(n) |O(1) | Medium| 
-|417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PacificAtlanticWaterFlow.java) | O(m*n*Max(m,n)) |O(m*n) | Medium| DFS
+|417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_417.java) | O(m*n*Max(m,n)) |O(m*n) | Medium| DFS
 |416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_416.java)| O(m*n)|O(m*n) | Medium | DP
 |415|[Add Strings](https://leetcode.com/problems/add-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_415.java)| O(n)|O(1) | Easy|
 |414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_414.java)| O(n)|O(1) | Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_417.java b/src/main/java/com/fishercoder/solutions/_417.java
@@ -16,7 +16,7 @@
 
 [[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]] (positions with parentheses in above matrix).*/
 
-public class PacificAtlanticWaterFlow {
+public class _417 {
     //looked at this post: https://discuss.leetcode.com/topic/62379/java-bfs-dfs-from-ocean
     
     /**One typical trick to work on 2d grid problems is to go through the border and put proper ones into a queue if using BFS.*/
@@ -61,7 +61,7 @@ void dfs(int[][] matrix, boolean[][] visited, int height, int x, int y){
     }
     
     public static void main(String...args){
-        PacificAtlanticWaterFlow test = new PacificAtlanticWaterFlow();
+        _417 test = new _417();
 //        int[][] matrix = new int[][]{
 //                {1,2,2,3,5},
 //                {3,2,3,4,4},
