Open robert-min opened 11 months ago
package main
import "fmt"
func main() {
slice := []int{1, 2, 3, 4, 5}
slice = append(slice, 0)
idx := 2 // 추가하려는 위치
for i := len(slice) - 2; i >= idx; i-- {
slice[i+1] = slice[i]
}
slice[idx] = 100
fmt.Println(slice)
}
package main
import (
"fmt"
)
func main() {
slice := []int{1, 2, 3, 4, 5}
idx := 2 // 추가하려는 위치
slice = append(slice[:idx], append([]int{100}, slice[idx:]...)...)
fmt.Println(slice)
}
package main
import "fmt"
func main() {
slice := []int{1, 2, 3, 4, 5}
idx := 2 // 추가하려는 위치
slice = append(slice, 0)
copy(slice[idx+1:], slice[idx:])
slice[idx] = 100
fmt.Println(slice)
}
package main
import (
"fmt"
"sort"
)
func main() {
slice := []int{8, 2, 6, 4, 5}
sort.Ints(slice)
fmt.Println(slice)
}
package main
import (
"fmt"
"sort"
)
type Student struct {
Name string
Age int
}
type Students []Student
func (s Students) Len() int {
return len(s)
}
func (s Students) Less(i, j int) bool {
return s[i].Age < s[j].Age
}
func (s Students) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func main() {
s := []Student{
{"김", 1}, {"박", 11}, {"한", 5},
}
sort.Sort(Students(s))
fmt.Println(s)
}
슬라이스 요소 삭제
append 함수로 개선