Golang策略模式详解与实现方法

type SortStrategy interface {
    Sort([]int) []int
}

type BubbleSort struct{}
func (b *BubbleSort) Sort(data []int) []int {
result := make([]int, len(data))
copy(result, data)
n := len(result)
for i := 0; i < n-1; i++ {
for j := 0; j < n-i-1; j++ {
if result[j] > result[j+1] {
result[j], result[j+1] = result[j+1], result[j]
}
}
}
return result
}
type QuickSort struct{}
func (q *QuickSort) Sort(data []int) []int {
result := make([]int, len(data))
copy(result, data)
quickSortHelper(result, 0, len(result)-1)
return result
}
func quickSortHelper(arr []int, low, high int) {
if low < high {
pi := partition(arr, low, high)
quickSortHelper(arr, low, pi-1)
quickSortHelper(arr, pi+1, high)
}
}
func partition(arr []int, low, high int) int {
pivot := arr[high]
i := low - 1
for j := low; j < high; j++ {
if arr[j] <= pivot {
i++
arr[i], arr[j] = arr[j], arr[i]
}
}
arr[i+1], arr[high] = arr[high], arr[i+1]
return i + 1
}

type Sorter struct {
    strategy SortStrategy
}
func (s *Sorter) SetStrategy(strategy SortStrategy) {
s.strategy = strategy
}
func (s *Sorter) Sort(data []int) []int {
if s.strategy == nil {
panic("未设置排序策略")
}
return s.strategy.Sort(data)
}

func main() {
    data := []int{64, 34, 25, 12, 22, 11, 90}
sorter := &Sorter{}

// 使用冒泡排序
sorter.SetStrategy(&BubbleSort{})
sorted1 := sorter.Sort(data)
fmt.Println("冒泡排序结果:", sorted1)

// 切换为快速排序
sorter.SetStrategy(&QuickSort{})
sorted2 := sorter.Sort(data)
fmt.Println("快速排序结果:", sorted2)
}