Skip to content

feat: add solutions to lc problem: No.2163 #4574

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 17, 2025
Merged

feat: add solutions to lc problem: No.2163 #4574

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions solution/0800-0899/0871.Minimum Number of Refueling Stops/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -206,14 +206,14 @@ func (h *hp) Pop() any {

```ts
function minRefuelStops(target: number, startFuel: number, stations: number[][]): number {
const pq = new MaxPriorityQueue();
const pq = new MaxPriorityQueue<number>();
let [ans, pre] = [0, 0];
stations.push([target, 0]);
for (const [pos, fuel] of stations) {
const dist = pos - pre;
startFuel -= dist;
while (startFuel < 0 && !pq.isEmpty()) {
startFuel += pq.dequeue().element;
startFuel += pq.dequeue();
ans++;
}
if (startFuel < 0) {
Expand Down
4 changes: 2 additions & 2 deletions solution/0800-0899/0871.Minimum Number of Refueling Stops/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -203,14 +203,14 @@ func (h *hp) Pop() any {

```ts
function minRefuelStops(target: number, startFuel: number, stations: number[][]): number {
const pq = new MaxPriorityQueue();
const pq = new MaxPriorityQueue<number>();
let [ans, pre] = [0, 0];
stations.push([target, 0]);
for (const [pos, fuel] of stations) {
const dist = pos - pre;
startFuel -= dist;
while (startFuel < 0 && !pq.isEmpty()) {
startFuel += pq.dequeue().element;
startFuel += pq.dequeue();
ans++;
}
if (startFuel < 0) {
Expand Down
4 changes: 2 additions & 2 deletions solution/0800-0899/0871.Minimum Number of Refueling Stops/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,12 +1,12 @@
function minRefuelStops(target: number, startFuel: number, stations: number[][]): number {
const pq = new MaxPriorityQueue();
const pq = new MaxPriorityQueue<number>();
let [ans, pre] = [0, 0];
stations.push([target, 0]);
for (const [pos, fuel] of stations) {
const dist = pos - pre;
startFuel -= dist;
while (startFuel < 0 && !pq.isEmpty()) {
startFuel += pq.dequeue().element;
startFuel += pq.dequeue();
ans++;
}
if (startFuel < 0) {
Expand Down
64 changes: 58 additions & 6 deletions ...n/2100-2199/2163.Minimum Difference in Sums After Removal of Elements/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -264,25 +264,25 @@ function minimumDifference(nums: number[]): number {
const n = Math.floor(m / 3);
let s = 0;
const pre: number[] = Array(m + 1);
const q1 = new MaxPriorityQueue();
const q1 = new MaxPriorityQueue<number>();
for (let i = 1; i <= n * 2; ++i) {
const x = nums[i - 1];
s += x;
q1.enqueue(x, x);
q1.enqueue(x);
if (q1.size() > n) {
s -= q1.dequeue().element;
s -= q1.dequeue();
}
pre[i] = s;
}
s = 0;
const suf: number[] = Array(m + 1);
const q2 = new MinPriorityQueue();
const q2 = new MinPriorityQueue<number>();
for (let i = m; i > n; --i) {
const x = nums[i - 1];
s += x;
q2.enqueue(x, x);
q2.enqueue(x);
if (q2.size() > n) {
s -= q2.dequeue().element;
s -= q2.dequeue();
}
suf[i] = s;
}
Expand All @@ -294,6 +294,58 @@ function minimumDifference(nums: number[]): number {
}
```

#### Rust

```rust
use std::collections::BinaryHeap;
use std::cmp::Reverse;

impl Solution {
pub fn minimum_difference(nums: Vec<i32>) -> i64 {
let m = nums.len();
let n = m / 3;
let mut s = 0i64;
let mut pre = vec![0i64; m + 1];
let mut pq = BinaryHeap::new(); // max-heap

for i in 1..=2 * n {
let x = nums[i - 1] as i64;
s += x;
pq.push(x);
if pq.len() > n {
if let Some(top) = pq.pop() {
s -= top;
}
}
pre[i] = s;
}

s = 0;
let mut suf = vec![0i64; m + 1];
let mut pq = BinaryHeap::new();

for i in (n + 1..=m).rev() {
let x = nums[i - 1] as i64;
s += x;
pq.push(Reverse(x));
if pq.len() > n {
if let Some(Reverse(top)) = pq.pop() {
s -= top;
}
}
suf[i] = s;
}

let mut ans = i64::MAX;
for i in n..=2 * n {
ans = ans.min(pre[i] - suf[i + 1]);
}

ans
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
64 changes: 58 additions & 6 deletions ...100-2199/2163.Minimum Difference in Sums After Removal of Elements/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -264,25 +264,25 @@ function minimumDifference(nums: number[]): number {
const n = Math.floor(m / 3);
let s = 0;
const pre: number[] = Array(m + 1);
const q1 = new MaxPriorityQueue();
const q1 = new MaxPriorityQueue<number>();
for (let i = 1; i <= n * 2; ++i) {
const x = nums[i - 1];
s += x;
q1.enqueue(x, x);
q1.enqueue(x);
if (q1.size() > n) {
s -= q1.dequeue().element;
s -= q1.dequeue();
}
pre[i] = s;
}
s = 0;
const suf: number[] = Array(m + 1);
const q2 = new MinPriorityQueue();
const q2 = new MinPriorityQueue<number>();
for (let i = m; i > n; --i) {
const x = nums[i - 1];
s += x;
q2.enqueue(x, x);
q2.enqueue(x);
if (q2.size() > n) {
s -= q2.dequeue().element;
s -= q2.dequeue();
}
suf[i] = s;
}
Expand All @@ -294,6 +294,58 @@ function minimumDifference(nums: number[]): number {
}
```

#### Rust

```rust
use std::collections::BinaryHeap;
use std::cmp::Reverse;

impl Solution {
pub fn minimum_difference(nums: Vec<i32>) -> i64 {
let m = nums.len();
let n = m / 3;
let mut s = 0i64;
let mut pre = vec![0i64; m + 1];
let mut pq = BinaryHeap::new(); // max-heap

for i in 1..=2 * n {
let x = nums[i - 1] as i64;
s += x;
pq.push(x);
if pq.len() > n {
if let Some(top) = pq.pop() {
s -= top;
}
}
pre[i] = s;
}

s = 0;
let mut suf = vec![0i64; m + 1];
let mut pq = BinaryHeap::new();

for i in (n + 1..=m).rev() {
let x = nums[i - 1] as i64;
s += x;
pq.push(Reverse(x));
if pq.len() > n {
if let Some(Reverse(top)) = pq.pop() {
s -= top;
}
}
suf[i] = s;
}

let mut ans = i64::MAX;
for i in n..=2 * n {
ans = ans.min(pre[i] - suf[i + 1]);
}

ans
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
47 changes: 47 additions & 0 deletions solution/2100-2199/2163.Minimum Difference in Sums After Removal of Elements/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,47 @@
use std::cmp::Reverse;
use std::collections::BinaryHeap;

impl Solution {
pub fn minimum_difference(nums: Vec<i32>) -> i64 {
let m = nums.len();
let n = m / 3;
let mut s = 0i64;
let mut pre = vec![0i64; m + 1];
let mut pq = BinaryHeap::new(); // max-heap

for i in 1..=2 * n {
let x = nums[i - 1] as i64;
s += x;
pq.push(x);
if pq.len() > n {
if let Some(top) = pq.pop() {
s -= top;
}
}
pre[i] = s;
}

s = 0;
let mut suf = vec![0i64; m + 1];
let mut pq = BinaryHeap::new();

for i in (n + 1..=m).rev() {
let x = nums[i - 1] as i64;
s += x;
pq.push(Reverse(x));
if pq.len() > n {
if let Some(Reverse(top)) = pq.pop() {
s -= top;
}
}
suf[i] = s;
}

let mut ans = i64::MAX;
for i in n..=2 * n {
ans = ans.min(pre[i] - suf[i + 1]);
}

ans
}
}
12 changes: 6 additions & 6 deletions solution/2100-2199/2163.Minimum Difference in Sums After Removal of Elements/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,25 +3,25 @@ function minimumDifference(nums: number[]): number {
const n = Math.floor(m / 3);
let s = 0;
const pre: number[] = Array(m + 1);
const q1 = new MaxPriorityQueue();
const q1 = new MaxPriorityQueue<number>();
for (let i = 1; i <= n * 2; ++i) {
const x = nums[i - 1];
s += x;
q1.enqueue(x, x);
q1.enqueue(x);
if (q1.size() > n) {
s -= q1.dequeue().element;
s -= q1.dequeue();
}
pre[i] = s;
}
s = 0;
const suf: number[] = Array(m + 1);
const q2 = new MinPriorityQueue();
const q2 = new MinPriorityQueue<number>();
for (let i = m; i > n; --i) {
const x = nums[i - 1];
s += x;
q2.enqueue(x, x);
q2.enqueue(x);
if (q2.size() > n) {
s -= q2.dequeue().element;
s -= q2.dequeue();
}
suf[i] = s;
}
Expand Down