Commit bc075d2

committed

clean code

1 parent 0d8ee85 commit bc075d2Copy full SHA for bc075d2

File tree

-3

lines changed

-3

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -59,4 +59,6 @@ public int sumSubarrayMins(int[] arr) {`
`59`	`59`	`单调栈分别求出左右两侧第一个比 arr[i] 小的下标。`
`60`	`60`	`假设 arr[i] 为 arr[l,r] 区间内的最小值,其贡献值为 arr[i] 本身乘以 arr[l,r] 区间内包含 arr[i] 子数组的数量,即为 (i-l)*(r-i) 的乘积。`
`61`	`61`	`时间复杂度 O(n)`
	`62`	`+相似题目: 3430. 最多 K 个元素的子数组的最值之和`
	`63`	`+https://leetcode.cn/problems/maximum-and-minimum-sums-of-at-most-size-k-subarrays/description/`
`62`	`64`	`*/`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -21,6 +21,7 @@ public int maxProductDifference(int[] nums) {`
`21`	`21`	`4 <= nums.length <= 10^4`
`22`	`22`	`1 <= nums[i] <= 10^4`
`23`	`23`
	`24`	`+中国时间:2021年06月27日 10:30`
	`25`	`+梦开始的地方:首次参加周赛。`
`24`	`26`	`数组排序后,最大两个数乘积减去最小两个数乘积即可。`
`25`		`-梦开始的地方:2021年06月27日首次参加周赛。`
`26`	`27`	`*/`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,5 +26,7 @@ public int countTriples(int n) {`
`26`	`26`	`提示:`
`27`	`27`	`1 <= n <= 250`
`28`	`28`
	`29`	`+中国时间:2021年07月10日 22:30`
	`30`	`+在网吧打的周赛。。`
`29`	`31`	`直接枚举即可`
`30`	`32`	`*/`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -22,6 +22,7 @@ public int maxGoodNumber(int[] nums) {`
`22`	`22`	`1 <= nums[i] <= 127`
`23`	`23`
`24`	`24`	`中国时间:2024年10月06日 10:30`
	`25`	`+国庆假期`
`25`	`26`	`相似题目: bytedance-010. 数组组成最大数`
`26`	`27`	`https://leetcode.cn/problems/9nsGSS/`
`27`	`28`	`*/`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -57,5 +57,5 @@ private long maximumWhiteTiles(int[][] tiles, int carpetLen) {`
`57`	`57`	`线段树会 TLE。只能滑动窗口。`
`58`	`58`	`相似题目: 2271. 毯子覆盖的最多白色砖块数`
`59`	`59`	`https://leetcode.cn/problems/maximum-white-tiles-covered-by-a-carpet/`
`60`		`-rating 2333 (clist.by)`
	`60`	`+rating 2377 (clist.by)`
`61`	`61`	`*/`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -89,5 +89,5 @@ private int compareLists(List<Integer> a, List<Integer> b) {`
`89`	`89`
`90`	`90`	`相似题目: 1235. 规划兼职工作`
`91`	`91`	`https://leetcode.cn/problems/maximum-profit-in-job-scheduling/`
`92`		`-rating 2613 (clist.by)`
	`92`	`+rating 2724 (clist.by)`
`93`	`93`	`*/`

Comments

(0)