泡泡爱上巧克力201710231836186

分类

/ 注册

全部文章（共34篇）

题解 | 打印两个升序链表的公共部分

package main import ( "bufio" "fmt" "os" "strconv" ) func main() { for { // 大数据读入时，性能比较高 scan...

2025-09-02

0 14

题解 | 奇数下标都是奇数或者偶数下标都是偶数

package main import ( "fmt" ) func main() { row := 0 for { n, _ := fmt.Scan(&row) if n == 0 { ...

2025-09-02

0 13

题解 | 龙与地下城游戏问题

package main import ( "fmt" ) func main() { n, m := 0, 0 for { num, _ := fmt.Scan(&n, &m) if num == 0 { break } else {...

2025-08-31

0 15

题解 | 分金条的最小花费

package main import ( "container/heap" "fmt" ) type Myheap []int func (m Myheap) Len() int {return len(m)} func (m Myheap) Swa...

2025-08-26

0 18

题解 | 最长公共子串

package main import ( "fmt" ) func main() { var str1 string var str2 string for { n, _ := fmt.Scan(&str1, &...

2025-08-25

0 17

题解 | 表达式得到期望结果的组合种数

package main import ( "fmt" ) func main() { var str string var desired bool for { n, _ := fmt.Scan(&str, &desired) if n ==...

2025-08-24

0 16

题解 | 换钱的最少货币数

package main import ( "fmt" ) func main() { num, target := 0, 0 for { n, _ := fmt.Scan(&num, &target) ...

2025-08-20

0 14

题解 | 最长公共子序列

package main import ( "fmt" ) func main() { var str1 string var str2 string for { n, _ := fmt.Scan(&str1, &str2) if n == 0...

2025-08-20

0 14

题解 | 机器人达到指定位置方法数

package main import ( "fmt" ) func main() { N, M, K, P := 0, 0, 0, 0 for { n, _ := fmt.Scan(&N, &M, &K, &P) if n ==...

2025-08-17

0 24

题解 | 数组中值出现了一次的数字

package main import ( "fmt" ) func main() { num := 0 for { n, _ := fmt.Scan(&num) if n == 0 { break } else { arr := mak...

2025-08-17

0 22