mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-24 17:17:14 +00:00
Yudong Jin
2778a6f9c7
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
36 lines
1.2 KiB
Go
36 lines
1.2 KiB
Go
// File: coin_change_greedy_test.go
|
|
// Created Time: 2023-07-23
|
|
// Author: Reanon (793584285@qq.com)
|
|
|
|
package chapter_greedy
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
)
|
|
|
|
func TestCoinChangeGreedy(t *testing.T) {
|
|
// Greedy algorithm: Can guarantee finding the global optimal solution
|
|
coins := []int{1, 5, 10, 20, 50, 100}
|
|
amt := 186
|
|
res := coinChangeGreedy(coins, amt)
|
|
fmt.Printf("coins = %v, amt = %d\n", coins, amt)
|
|
fmt.Printf("Minimum number of coins needed to make %d is %d\n", amt, res)
|
|
|
|
// Greedy algorithm: Cannot guarantee finding the global optimal solution
|
|
coins = []int{1, 20, 50}
|
|
amt = 60
|
|
res = coinChangeGreedy(coins, amt)
|
|
fmt.Printf("coins = %v, amt = %d\n", coins, amt)
|
|
fmt.Printf("Minimum number of coins needed to make %d is %d\n", amt, res)
|
|
fmt.Println("Actually the minimum number needed is 3, i.e., 20 + 20 + 20")
|
|
|
|
// Greedy algorithm: Cannot guarantee finding the global optimal solution
|
|
coins = []int{1, 49, 50}
|
|
amt = 98
|
|
res = coinChangeGreedy(coins, amt)
|
|
fmt.Printf("coins = %v, amt = %d\n", coins, amt)
|
|
fmt.Printf("Minimum number of coins needed to make %d is %d\n", amt, res)
|
|
fmt.Println("Actually the minimum number needed is 2, i.e., 49 + 49")
|
|
}
|