edit 119

fishercoder1534 · fishercoder1534 · commit 89cc0a23aa16 · 2017-07-24T07:43:45.000-07:00
diff --git a/README.md b/README.md
@@ -440,7 +440,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_122.java)| O(n)|O(1) | Medium | Greedy
 |121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_121.java)| O(n)|O(1) | Easy| DP
 |120|[Triangle](https://leetcode.com/problems/triangle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_120.java)| O(m*n)|O(n) | Medium| DP
-|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PascalsTriangleII.java)| O(n^2)|O(1) | Easy| 
+|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_119.java)| O(n^2)|O(1) | Easy| 
 |118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_118.java)| O(n^2)|O(1) | Easy| 
 |117|[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_117.java)| O(n)|O(1) | Medium| BFS
 |116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_116.java)| O(n)|O(1) | Medium| BFS
diff --git a/src/main/java/com/fishercoder/solutions/_119.java b/src/main/java/com/fishercoder/solutions/_119.java
@@ -7,7 +7,8 @@
 
  Note:
  Could you optimize your algorithm to use only O(k) extra space?*/
-public class PascalsTriangleII {
+
+public class _119 {
 
     public List<Integer> getRow(int rowIndex) {
         if(rowIndex < 0) return new ArrayList();
