leetcode-5.20[1356. 根据数字二进制下 1 的数目排序、977. 有序数组的平方、1221. 分割平衡字符串]（python实现)

题目1

题解1

class Solution:
    def sortByBits(self, arr: List[int]) -> List[int]:
        res = []
        d = {}
        for i in arr:
            n = self.oneCount(i)
            if n not in d:
                d[n] =[]
            d[n].append(i)
        # 字典键值排序
        for i in sorted(d):
            # 对键对应的列表值排序
            res+=sorted(d[i])
        return res

    def oneCount(self, n: int) -> int:
        count = 0
        if n < 0:
            n &= 0xffffffff
        while n:
            n = n&(n-1)
            count += 1
        return count

附上题目链接

题目2

题解2

class Solution:
    def sortedSquares(self, A: List[int]) -> List[int]:
        # 根据绝对值排序
        A.sort(key=lambda x: abs(x))
        # 用map映射出每个元素的平方
        return list(map(lambda x:x**2,A))

附上题目链接

题目3

题解3

class Solution:
    def balancedStringSplit(self, s: str) -> int:
        L_count = 0
        R_count = 0
        count = 0
        for w in s:
            if w == 'R':
                if L_count == R_count:
                    count += 1
                    L_count, R_count = 0,0
                L_count += 1
            if w == 'L':
                if L_count == R_count:
                    count += 1
                    L_count, R_count = 0,0
                R_count += 1
        return count

附上题目链接