LeetCode笔记：Weekly Contest 251（补发）

class Solution:
    def getLucky(self, s: str, k: int) -> int:
        s = "".join([str(ord(c)-ord('a')+1) for c in s])
        for _ in range(k):
            s = str(sum(int(c) for c in s))
        return int(s)

class Solution:
    def maximumNumber(self, num: str, change: List[int]) -> str:
        n = len(num)
        for i, c in enumerate(num):
            c = int(c)
            if change[c] <= c:
                continue
            j = i
            while j < n and change[int(num[j])] >= int(num[j]):
                j += 1
            return num[:i] + "".join([str(change[int(x)]) for x in num[i:j]]) + num[j:]
        return num

class Solution:
    def maxCompatibilitySum(self, students: List[List[int]], mentors: List[List[int]]) -> int:
        n = len(students)
        scores = [[sum([1-x^y for x, y in zip(students[i], mentors[j])]) for j in range(n)] for i in range(n)]
        
        @lru_cache(None)
        def dp(idx, status):
            if idx == n:
                return 0
            return max(scores[idx][i] + dp(idx+1, status^(1<<i)) for i in range(n) if status&(1<<i) == 0)
        
        return dp(0, 0)