sss

61 阅读1分钟

package change

import "fmt"

//金字塔

func jzt(number int) {

for i := 1; i <= number; i++ {
	// 输出 空格
	for k := 1; k <= number-i; k++ {
		fmt.Print(" ")
	}
	//输出※
	for x := 1; x <= 2*i-1; x++ {
		fmt.Print("*")
	}
	fmt.Print("\n")

}

}

//空心金字塔 func kxzjt(number int) { for i := 1; i <= number; i++ { // 输出 空格 for k := 1; k <= number-i; k++ { fmt.Print(" ") } //输出※ for x := 1; x <= 2i-1; x++ { //头和尾 左右两边 if i == 1 || i == number || x == 1 || x == 2i-1 { fmt.Print("*") } else { fmt.Print(" ") }

	}
	fmt.Print("\n")

}

}

//九九乘法表

func jjcfb() { for i := 1; i <= 9; i++ { for j := 1; j <= i; j++ { fmt.Printf("%d * %d = %d ", j, i, i*j) } fmt.Print("\n") } }

// 猴子吃桃 func eat(banner, day int) int { if day == 1 { return banner } banner = 2 * (banner + 1) return eat(banner, day-1)

}

// 生产斐波那契数列

func create_fbn(number int) []int { var slice = make([]int, number)

for i := 0; i < number; i++ {
	if i == 0 || i == 1 {
		slice[i] = 1
	} else {
		slice[i] = slice[i-1] + slice[i-2]
	}

}
return slice

}

// 查找斐波那契位置 func search_fbn(number int) int { if number == 1 || number == 2 { return 1 } else { return search_fbn(number-1) + search_fbn(number-2) }

}

//冒泡排序

func mpSort(arr []int) { for i := 0; i < len(arr); i++ { for j := 0; j < len(arr)-i-1; j++ { if arr[j] > arr[j+1] { arr[j], arr[j+1] = arr[j+1], arr[j] }

	}

}

}

func twoFind(arr []int, find_int int) {

len_arr := len(arr)

if len_arr == 1 && arr[0] != find_int {
	fmt.Print("没有")
	return
}
middle_val := len_arr / 2

if arr[middle_val] == find_int {
	fmt.Print("有")
	return
}

if arr[middle_val] > find_int {
	twoFind(arr[:middle_val], find_int)
}
if arr[middle_val] < find_int {
	twoFind(arr[middle_val:], find_int)
}

}

// jzt(5) // kxzjt(5) // jjcfb() // eat_res := eat(1, 10) // fmt.Print(eat_res) // fbn_arr := create_fbn(8) // fmt.Print(fbn_arr) // fbn_find := search_fbn(8) // fmt.Print(fbn_find) // order_arr := []int{64, 34, 25, 12, 22, 11, 90} // mpSort(order_arr) // fmt.Print(order_arr)