力扣第 172 场双周赛

class Solution:
    def minOperations(self, nums: List[int]) -> int:
        ans = 0
        st = set()
        for i in range((len(nums) + 2) // 3, -1, -1):
            for x in nums[3 * i : 3 * i + 3]:
                if x in st:
                    return i + 1
                st.add(x)
        return 0

class Solution:
    def maximumSum(self, nums: List[int]) -> int:
        mod3 = [[] for _ in range(3)]
        ans = 0
        for x in nums:
            mod3[x % 3].append(x)
        for row in mod3:
            row.sort(reverse=True)

        st = []
        for i in range(4):
            for j in range(4):
                for k in range(4):
                    if i + j + k == 3 and (j + 2 * k) % 3 == 0:
                        st.append([i, j, k])
        ans = 0
        for p in st:
            tmp = 0
            flag = True
            for i, v in enumerate(p):
                if len(mod3[i]) < v:
                    flag = False
                    break
                tmp += sum(mod3[i][:v])
            if flag:
                ans = max(tmp, ans)
        return ans

class Solution:
    def maximumScore(self, nums: List[int], s: str) -> int:
        h = []
        ans = 0
        for i in range(len(nums) - 1, -1, -1):
            heappush(h, nums[i])
            ans += nums[i]
            if s[i] == "0":
                ans -= heappop(h)
        return ans

class Solution:
    def lastInteger(self, n: int) -> int:
        st = 1
        base = 1
        flag = True
        while n > 1:
            if n % 2 == 0:
                if not flag:
                    st += base
            n = (n + 1) // 2
            flag = not flag
            base *= 2
        return st