摘要:
1 public class Solution { 2 public int numSquares(int n) { 3 int[] dp = new int[n + 1]; 4 for (int i = 1; i <= n; i++) { 5 dp[i] = i; 6 for (int j = ... 阅读全文
摘要:
O (n) solution. 阅读全文
摘要:
This is almost the version of K list iterators. 阅读全文
摘要:
1. Deal with 0 situation : only 0 itself is allowed, it cannot be 04. 2. We have to record the previous value that can be used to extract from previou 阅读全文