edit 437

fishercoder1534 · fishercoder1534 · commit 3660dc6e4328 · 2017-07-24T07:41:58.000-07:00
diff --git a/README.md b/README.md
@@ -167,7 +167,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |440|[K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_440.java)| O(n^2)|O(1) | Hard|
 |439|[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_439.java)| O(n)|O(n) | Medium| Stack
 |438|[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FindAllAnagramsinaString.java)| O(n)|O(1) | Easy|
-|437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PathSumIII.java) | O(n^2) |O(n) | Easy| DFS, recursion
+|437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_437.java) | O(n^2) |O(n) | Easy| DFS, recursion
 |436|[Find Right Interval](https://leetcode.com/problems/find-right-interval/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FindRightInterval.java) | O(nlogn) |O(n) | Medium| Binary Search
 |435|[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_435.java) | O(nlogn) |O(1) | Medium| Greedy
 |434|[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/NumberofSegmentsinaString.java)| O(n)|O(1) | Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_437.java b/src/main/java/com/fishercoder/solutions/_437.java
@@ -29,7 +29,8 @@ The path does not need to start or end at the root or a leaf, but it must go dow
  2.  5 -> 2 -> 1
  3. -3 -> 11
  */
-public class PathSumIII {
+
+public class _437 {
 
     public int pathSum(TreeNode root, int sum) {
         if (root == null) return 0;
