笔记
18岁程序猿想当算法工程师
这个作者很懒,什么都没留下…
展开
-
Leetcode k个逆序数组对
class Solution { public int kInversePairs(int n, int k) { final int MOD = 1000000007; int[][] f = new int[2][k + 1]; f[0][0] = 1; for (int i = 1; i <= n; ++i) { for (int j = 0; j <= k; ++j) {原创 2021-11-11 21:32:54 · 183 阅读 · 0 评论 -
Leetcode 495提莫攻击
public int findPoisonedDuration(int[] timeSeries, int duration) { int constandTime=0,countTime=0; for(int i=0;i<timeSeries.length;i++){ if(timeSeries[i]>=constandTime) { countTime+...原创 2021-11-10 20:06:09 · 75 阅读 · 0 评论 -
Leetcode祖玛游戏
class Solution { int INF = 0x3f3f3f3f; String b; int m; Map<String, Integer> map = new HashMap<>(); public int findMinStep(String a, String _b) { b = _b; m = b.length(); int ans = dfs(a, 1 << m)原创 2021-11-09 19:05:53 · 2435 阅读 · 0 评论