Skip to content

fix links not found #864

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

fix links not found #864

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions eBook/07.1.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -138,15 +138,15 @@ func main() {

**练习**

练习7.1：[array_value.go](examples/chapter_7/array_value.go):
练习7.1：[array_value.go](exercises/chapter_7/array_value.go):

证明当数组赋值时，发生了数组内存拷贝。

练习7.2：[for_array.go](examples/chapter_7/for_array.go):
练习7.2：[for_array.go](exercises/chapter_7/for_array.go):

写一个循环并用下标给数组赋值（从 0 到 15）并且将数组打印在屏幕上。

练习7.3：[fibonacci_array.go](examples/chapter_7/fibonacci_array.go):
练习7.3：[fibonacci_array.go](exercises/chapter_7/fibonacci_array.go):

在[第 6.6 节](06.6.md) 我们看到了一个递归计算 Fibonacci 数值的方法。但是通过数组我们可以更快的计算出 Fibonacci 数。完成该方法并打印出前 50 个 Fibonacci 数字。

Expand Down