Skip to content

Commit d8b925b

Browse files
committed
格式化
1 parent c70fe4c commit d8b925b

File tree

4 files changed

+6
-5
lines changed

4 files changed

+6
-5
lines changed
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
function maximumValue(strs: string[]): number {
22
return strs.reduce(
33
(p, c) => Math.max(p, /^\d+$/.test(c) ? Number(c) : c.length),
4-
0
4+
0,
55
);
66
}
77
export default maximumValue;

partition-to-k-equal-sum-subsets/index.ts

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,8 @@ export default function canPartitionKSubsets(
1111
let i = nums.length - 1;
1212
i >= 0 && nums[i] === sub;
1313
i--, k--, nums.pop()
14-
) { // deno-lint-ignore no-empty
14+
// deno-lint-ignore no-empty
15+
) {
1516
}
1617

1718
const n = nums.length;

snapshot-array/index.ts

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
1-
export default SnapshotArray;
21
class SnapshotArray {
32
shot: number;
43
map: Map<string, number>;
5-
constructor(length: number) {
4+
constructor(_length: number) {
65
this.shot = 0;
76
this.map = new Map();
87
}
@@ -25,3 +24,4 @@ class SnapshotArray {
2524
return 0;
2625
}
2726
}
27+
export default SnapshotArray;

sum-of-beauty-of-all-substrings/index.ts

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ function beautySum(s: string): number {
77
cnt[s[j].charCodeAt(0) - "a".charCodeAt(0)]++;
88
maxFreq = Math.max(
99
maxFreq,
10-
cnt[s[j].charCodeAt(0) - "a".charCodeAt(0)]
10+
cnt[s[j].charCodeAt(0) - "a".charCodeAt(0)],
1111
);
1212
let minFreq = s.length;
1313
for (let k = 0; k < 26; k++) {

0 commit comments

Comments
 (0)