package leetcode // 解法一 优化版 func maxOperations(nums []int, k int) int { counter, res := make(map[int]int), 0 for _, n := range nums { counter[n]++ } if (k & 1) == 0 { res += counter[k>>1] >> 1 // 能够由 2 个相同的数构成 k 的组合已经都排除出去了,剩下...
mark midmax = findmidmax(low,high,(int)Math.floor((float)N/2)); int k = (Math.max(leftmax.value, rightmax.value) > midmax.value) ? Math.max(leftmax.value, rightmax.value) : midmax.value; if(k == leftmax.value){return leftmax;} else if(k == rightmax.value){return right...