1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146
| package main import ( "fmt" ) func main() { var arr = []float64{5, 9, 12, 20, 36, 48} fmt.Println(arr) num := 30.0 i := 0 for index, value := range arr { if num < value { i = index break }
if num >= value { i = index + 1 } } if i < len(arr) { temp := append(arr[:i], arr[i-1:]...) arr = append(append(arr[:i], num), temp[i+1:]...) } else { arr = append(arr, float64(i)) }
fmt.Println(arr) }
func main() { var arr [5][5]int for i, v := range arr { for j, _ := range v { if i == 0 || i == len(arr)-1 { arr[i][j] = 0 } else { if j == 0 || j == len(v)-1 { arr[i][j] = 0 } else { fmt.Scanln(&arr[i][j]) } } } } for _, v := range arr { fmt.Printf("%d\n", v) } }
package main import ( "fmt" "math/rand" "time" ) func main() { var arr [10]int rand.Seed(time.Now().UnixNano()) for i := range arr { arr[i] = rand.Intn(101) } Bubble(&arr) fmt.Println(arr) index, s := Search(&arr, 58) fmt.Println(index, s) } func Bubble(arr *[10]int) { len := len(arr) for i := 0; i < len-1; i++ { for j := 0; j < len-i-1; j++ { if arr[j] > arr[j+1] { arr[j], arr[j+1] = arr[j+1], arr[j] } } } } func Search(arr *[10]int, num int) (int, string) { begin := 0 end := len(arr) - 1 for { middle := (begin + end) / 2 if arr[middle] == num { return middle, "找到了" } else if arr[middle] > num { end = middle - 1 } else { begin = middle + 1 } if begin > end { return -1, "找不到该参数" } } }
package main import ( "fmt" "math" ) func main() { var arr = []float64{90, 88, 55, 55, 100, 99, 68, 90} maxIndex, minIndex, _, average := FindMaxAndMin(arr) fmt.Println(maxIndex, minIndex) fmt.Println(average) for i := 0; i < len(arr); i++ { arr[i] = math.Abs(arr[i] - average) } fmt.Println(arr) maxIndexx, minIndexx, _, _ := FindMaxAndMin(arr) fmt.Println(maxIndexx, minIndexx)
}
func FindMaxAndMin(arr []float64) (maxIndex int, minIndex int, sum float64, average float64) { maxIndex, minIndex, sum, average = 0, 0, 0.0, 0.0 for i := 0; i < len(arr); i++ { sum += arr[i] if arr[i] > arr[maxIndex] { maxIndex = i } if arr[i] < arr[minIndex] { minIndex = i } if i == len(arr)-1 { forAver := sum - arr[maxIndex] - arr[minIndex] average = forAver / float64(len(arr)-2) } } return maxIndex, minIndex, sum, average }
|