Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit ba957c2

Browse files
authored
refactor: update ts solution to lc problem: No.1962 (doocs#3167)
1 parent 7325c86 commit ba957c2

File tree

3 files changed

+9
-21
lines changed

3 files changed

+9
-21
lines changed

‎solution/1900-1999/1962.Remove Stones to Minimize the Total/README.md‎

Lines changed: 3 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -185,14 +185,10 @@ function minStoneSum(piles: number[], k: number): number {
185185
pq.enqueue(x);
186186
}
187187
while (k--) {
188-
const x = pq.dequeue().element;
189-
pq.enqueue(x - ((x / 2) | 0));
188+
pq.enqueue((pq.dequeue().element + 1) >> 1);
190189
}
191-
let ans = 0;
192-
while (pq.size()) {
193-
ans += pq.dequeue().element;
194-
}
195-
return ans;
190+
191+
return pq.toArray().reduce((a, b) => a + b.element, 0);
196192
}
197193
```
198194

‎solution/1900-1999/1962.Remove Stones to Minimize the Total/README_EN.md‎

Lines changed: 3 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -183,14 +183,10 @@ function minStoneSum(piles: number[], k: number): number {
183183
pq.enqueue(x);
184184
}
185185
while (k--) {
186-
const x = pq.dequeue().element;
187-
pq.enqueue(x - ((x / 2) | 0));
186+
pq.enqueue((pq.dequeue().element + 1) >> 1);
188187
}
189-
let ans = 0;
190-
while (pq.size()) {
191-
ans += pq.dequeue().element;
192-
}
193-
return ans;
188+
189+
return pq.toArray().reduce((a, b) => a + b.element, 0);
194190
}
195191
```
196192

‎solution/1900-1999/1962.Remove Stones to Minimize the Total/Solution.ts‎

Lines changed: 3 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -4,12 +4,8 @@ function minStoneSum(piles: number[], k: number): number {
44
pq.enqueue(x);
55
}
66
while (k--) {
7-
const x = pq.dequeue().element;
8-
pq.enqueue(x - ((x / 2) | 0));
7+
pq.enqueue((pq.dequeue().element + 1) >> 1);
98
}
10-
let ans = 0;
11-
while (pq.size()) {
12-
ans += pq.dequeue().element;
13-
}
14-
return ans;
9+
10+
return pq.toArray().reduce((a, b) => a + b.element, 0);
1511
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /