闫氏DP分析法
记录动态规划的相关习题
Math
2834. 找出美丽数组的最小和
1234567891011121314class Solution { static final int MOD = (int)1e9 + 7; public int minimumPossibleSum(int n, int target) { int m = target / 2; if (n <= m) { return (int)(((long)1 + n) * n / 2 % MOD); } else { long firstPart = (((long)(1 + m) * m) / 2 % MOD); long secondPart = (((((long) target + target + (n - m) - 1) * (n - m)) / 2) % MOD); // System.out.println(firstPart + " " + secondPart); r ...
Blind-Sheet
总之先已刷完这个为目标
CS5520-Week2
record course material for CS5520 at NEU
CS5520-Week3-Views
record course material for CS5520 at NEU
CS5520-Week6-Networking
record course material for CS5520 at NEU
CS5520-Week7-Data-Storage
record course material for CS5520 at NEU
CS5520-Week8-Firebase
record course material for CS5520 at NEU
CS5520-Week4-Intents-RecyclerView
record course material for CS5520 at NEU
CS5520-Week5-Threads
record course material for CS5520 at NEU
