泡泡爱上巧克力201710231836186

分类

/ 注册

全部文章（共34篇）

题解 | 在其它数出现次数都为偶数的数组中找到出现次数为奇数次的数

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

2025-08-17

0 44

题解 | 在数组中找到一个局部最小的位置

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

2025-08-17

0 19

题解 | 数字字符转化为字母组合的种数

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

2025-08-16

0 19

题解 | 做项目的最大收益问题

package main import ( "container/heap" "fmt" ) type Elem struct { Cost int Profi int } type MinHeap struct { Data []Elem }...

2025-08-16

0 21

题解 | 自然数数组的排序

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

2025-08-15

0 20

题解 | 数组的partition调整

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

2025-08-14

0 23

题解 | 数组的partition调整补充问题

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

2025-08-14

0 18

题解 | 计算数组的小和

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

2025-08-13

0 26

题解 | 最长递增子序列

package main import ( "fmt" ) func max(i, j int) int { if i > j { return i } return j } func main() { num := 0 for { n, _ := ...

2025-08-09

0 31

题解 | 边界都是1的最大正方形大小

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

2025-08-07

0 19