Skip to content

Commit

Permalink
Merge pull request #229 from LiAuTraver/master
Browse files Browse the repository at this point in the history
Remove redundant comments
  • Loading branch information
chai2010 authored Oct 10, 2024
2 parents 56bbafb + 0cb5d25 commit 6869239
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions ch2/ch2-04.md
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@ x, y = y, x
a[i], a[j] = a[j], a[i]
```

或者是计算两个整数值的的最大公约数(GCD)(译注:GCD不是那个敏感字,而是greatest common divisor的缩写,欧几里德的GCD是最早的非平凡算法):
或者是计算两个整数值的的最大公约数(GCD)(译注:Greatest Common Divisor的缩写,欧几里德的GCD是最早的非平凡算法):

```Go
func gcd(x, y int) int {
Expand All @@ -58,7 +58,7 @@ func fib(n int) int {
}
```

元组赋值也可以使一系列琐碎赋值更加紧凑(译注: 特别是在for循环的初始化部分)
元组赋值也可以使一系列琐碎赋值更加紧凑(译注: 特别是在for循环的初始化部分):

```Go
i, j, k = 2, 3, 5
Expand Down

0 comments on commit 6869239

Please sign in to comment.