Search for a command to run...
Series
summary algorithm knowledge
343. 整数拆分 function integerBreak(n: number): number { let dp = new Array(n + 1).fill(0); dp[2] = 1; for(let i = 3; i <= n; i++) { for(let j = 1; j <= i / 2; j++) { dp[i] = Math.max(dp[i], dp[i - j] * j, (i - j) * j); ...
62. 不同路径 function uniquePaths(m: number, n: number): number { let dp = new Array(m).fill(1).map(() => new Array(n).fill(1)); for (let i = 1; i < m; i++) { for (let j = 1; j < n; j++) { dp[i][j] = dp[i - 1][j] + dp[i][j - ...
509. 斐波那契数 function fib(n: number): number { const dp = [0, 1]; for (let i = 2; i <= n; i++) { dp[i] = dp[i - 1] + dp[i - 2]; }; return dp[n]; }; 70. 爬楼梯 function climbStairs(n: number): number { const dp = [1, 1]; ...
738. 单调递增的数字 function monotoneIncreasingDigits(n: number): number { let strArr: number[] = String(n).split('').map(i => parseInt(i)); const length = strArr.length; let flag: number = length; for (let i = length - 1; i > 0; i--) { ...
435. 无重叠区间 function eraseOverlapIntervals(intervals: number[][]): number { let result = 0; intervals.sort((a, b) => a[0] - b[0]); for (let i = 1; i < intervals.length; i++) { if (intervals[i][0] < intervals[i - 1][1]) { ...
1005. K次取反后最大化的数组和 function largestSumAfterKNegations(nums: number[], k: number): number { nums.sort((a, b) => Math.abs(b) - Math.abs(a)); for (let i = 0; i < nums.length; i++) { if (nums[i] < 0 && k > 0) { nums[i] = -nu...
