简单问题:先排序,然后到最小值相加即可
func arrayPairSum(nums []int) int {
sort.Ints(nums)
var arLen int = len(nums)
var sum int = 0
for i := 0; i < arLen; i += 2 {
sum += nums[i]
}
return sum
}
简单问题:先排序,然后到最小值相加即可
func arrayPairSum(nums []int) int {
sort.Ints(nums)
var arLen int = len(nums)
var sum int = 0
for i := 0; i < arLen; i += 2 {
sum += nums[i]
}
return sum
}