摘要:
https://leetcode.com/problems/number-of-longest-increasing-subsequence/discuss/107293/JavaC++-Simple-dp-solution-with-explanation 每次记载最大长度 然后最后遍历 把等于最 阅读全文
摘要:
sort之后 看有没有可以等于sum/2的 阅读全文
摘要:
1 class Solution { 2 int[] colors; 3 public boolean possibleBipartition(int N, int[][] dislikes) { 4 if(dislikes.length == 0) return true; 5 HashMap> graph = new HashMap(... 阅读全文
摘要:
dp[个数][加起来的和] = 达到的次数 阅读全文