day6: 基本贪心问题

数组拆分I

func arrayPairSum(nums []int) int {
    sort.Ints(nums)
    sum := 0
    for i:=0;i<len(nums);i+=2 {
        sum += nums[i]
    }
    return sum
}

两个数对之间最大乘积差

func maxProductDifference(nums []int) int {
    sort.Ints(nums);
    length := len(nums)
    return nums[length-1]*nums[length-2] - nums[0]*nums[1]
}

最少操作使数组递增

func minOperations(nums []int) int {
    ans := 0
    if len(nums) == 1 {
        return ans
    }
    pre := nums[0]
    for i:=1;i<len(nums);i++ {
        cur := nums[i]
        if pre < cur {
            pre = cur
        }else{
            tmp := (pre-cur+1)
            ans += tmp
            pre = cur+tmp
        }
    }
    return ans
}

分发饼干

func findContentChildren(g []int, s []int) int {
    sort.Ints(g)
    sort.Ints(s)
    i, j := len(g)-1, len(s)-1
    ans := 0
    for i >=0 && j >= 0 {
        if s[j] >= g[i] {
            j--
            i--
            ans++
        } else {
            i--
        }
    }
    return ans
}

摆动排序

func wiggleSort(nums []int) {
    res := make([]int, len(nums))
    copy(res, nums)

    sort.Ints(res)
    size := len(nums)
    for i:=1;i<len(nums);i+=2 {
        size--
        nums[i] = res[size]
    }

    for i:=0;i<len(nums);i+=2 {
        size--
        nums[i] = res[size]
    }
}