xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-13 15:56:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix the content

Browse Source
This commit is contained in:
krahets
2023-08-10 11:35:16 +08:00
parent 932d14644d
commit 6ef4dc6444
10 changed files with 14 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/cpp/chapter_greedy/coin_change_greedy.cpp
+1 -1
View File
@@ -14,7 +14,7 @@ int coinChangeGreedy(vector<int> &coins, int amt) {
// 循环进行贪心选择，直到无剩余金额
while (amt > 0) {
// 找到小于且最接近剩余金额的硬币
while (coins[i] > amt) {
while (i > 0 && coins[i] > amt) {
i--;
}
// 选择 coins[i]
codes/csharp/chapter_greedy/coin_change_greedy.cs
+1 -1
View File
@@ -15,7 +15,7 @@ public class coin_change_greedy {
// 循环进行贪心选择，直到无剩余金额
while (amt > 0) {
// 找到小于且最接近剩余金额的硬币
while (coins[i] > amt) {
while (i > 0 && coins[i] > amt) {
i--;
}
// 选择 coins[i]
codes/go/chapter_greedy/coin_change_greedy.go
+1 -1
View File
@@ -12,7 +12,7 @@ func coinChangeGreedy(coins []int, amt int) int {
// 循环进行贪心选择，直到无剩余金额
for amt > 0 {
// 找到小于且最接近剩余金额的硬币
for coins[i] > amt {
for i > 0 && coins[i] > amt {
i--
}
// 选择 coins[i]
codes/java/chapter_greedy/coin_change_greedy.java
+1 -1
View File
@@ -17,7 +17,7 @@ public class coin_change_greedy {
// 循环进行贪心选择，直到无剩余金额
while (amt > 0) {
// 找到小于且最接近剩余金额的硬币
while (coins[i] > amt) {
while (i > 0 && coins[i] > amt) {
i--;
}
// 选择 coins[i]
codes/java/chapter_heap/top_k.java
+2 -2
View File
@@ -15,14 +15,14 @@ public class top_k {
Queue<Integer> heap = new PriorityQueue<Integer>();
// 将数组的前 k 个元素入堆
for (int i = 0; i < k; i++) {
heap.add(nums[i]);
heap.offer(nums[i]);
}
// 从第 k+1 个元素开始，保持堆的长度为 k
for (int i = k; i < nums.length; i++) {
// 若当前元素大于堆顶元素，则将堆顶元素出堆、当前元素入堆
if (nums[i] > heap.peek()) {
heap.poll();
heap.add(nums[i]);
heap.offer(nums[i]);
}
}
return heap;
codes/python/chapter_greedy/coin_change_greedy.py
+1 -1
View File
@@ -13,7 +13,7 @@ def coin_change_greedy(coins: list[int], amt: int) -> int:
# 循环进行贪心选择，直到无剩余金额
while amt > 0:
# 找到小于且最接近剩余金额的硬币
while coins[i] > amt:
while i > 0 and coins[i] > amt:
i -= 1
# 选择 coins[i]
amt -= coins[i]
codes/rust/chapter_greedy/coin_change_greedy.rs
+1 -1
View File
@@ -12,7 +12,7 @@ fn coin_change_greedy(coins: &[i32], mut amt: i32) -> i32 {
// 循环进行贪心选择，直到无剩余金额
while amt > 0 {
// 找到小于且最接近剩余金额的硬币
while coins[i] > amt {
while i > 0 && coins[i] > amt {
i -= 1;
}
// 选择 coins[i]