2

githubnotes · githubnotes · commit c628196a3569 · 2019-10-31T01:56:16.000-07:00
diff --git a/CF/gp/gp1.md b/CF/gp/gp1.md
@@ -0,0 +1,2 @@
+# 序列型动态规划/楼梯问题
+    - 512. Decode Ways
diff --git a/CF/gp/hf1.md b/CF/gp/hf1.md
@@ -144,8 +144,6 @@ public class Solution {
                 }
         }
         
-        
-        
         for (Map.Entry<Integer, PriorityQueue<Integer>> entry : hash.entrySet()) {
             int id = entry.getKey();
             PriorityQueue<Integer> scores = entry.getValue();

Original file line number	Diff line number	Diff line change
`@@ -144,8 +144,6 @@ public class Solution {`
`144`	`144`	`}`
`145`	`145`	`}`
`146`	`146`
`147`		`-`
`148`		`-`
`149`	`147`	`for (Map.Entry<Integer, PriorityQueue<Integer>> entry : hash.entrySet()) {`
`150`	`148`	`int id = entry.getKey();`
`151`	`149`	`PriorityQueue<Integer> scores = entry.getValue();`