在Debian上使用Golang进行数据结构与算法实现,可以按照以下步骤进行:
sudo apt update
sudo apt install golang-go
验证安装:
go version
.deb 文件)。dpkg 命令安装:wget https://golang.org/dl/go1.20.5.linux-amd64.deb
sudo dpkg -i go1.20.5.linux-amd64.deb
解决依赖问题:
sudo apt-get install -f
验证安装:
go version
编辑 ~/.bashrc 或 ~/.profile 文件,添加以下内容:
export PATH=$PATH:/usr/local/go/bin
export GOPATH=$HOME/go
export GOBIN=$GOPATH/bin
使配置生效:
source ~/.bashrc
package main
import "fmt"
func main() {
slice := []int{1, 2, 3, 4, 5}
fmt.Println(slice)
}
package main
import "fmt"
func main() {
m := make(map[string]int)
m["one"] = 1
m["two"] = 2
fmt.Println(m)
}
package main
import "fmt"
type Person struct {
Name string
Age int
}
func main() {
p := Person{Name: "Alice", Age: 30}
fmt.Println(p)
}
package main
import (
"fmt"
"sort"
)
func quickSort(arr []int) []int {
if len(arr) < 2 {
return arr
}
pivot := arr[0]
var less, greater []int
for _, v := range arr[1:] {
if v <= pivot {
less = append(less, v)
} else {
greater = append(greater, v)
}
}
return append(append(quickSort(less), pivot), quickSort(greater)...)
}
func main() {
arr := []int{64, 34, 25, 12, 22, 11, 90}
sortedArr := quickSort(arr)
fmt.Println(sortedArr)
}
package main
import (
"fmt"
"sort"
)
func binarySearch(arr []int, target int) int {
low, high := 0, len(arr)-1
for low <= high {
mid := low + (high-low)/2
if arr[mid] == target {
return mid
} else if arr[mid] < target {
low = mid + 1
} else {
high = mid - 1
}
}
return -1
}
func main() {
arr := []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
target := 5
index := binarySearch(arr, target)
fmt.Println(index)
}
以上步骤和代码示例应该能帮助你在Debian系统上成功安装Golang,并实现一些基本的数据结构与算法。