算法

Hailin

NO.1009 十进制整数的反码

class Solution: def bitwiseComplement(self, n: int) -> int: # 如果是0直接返回1 if n == 0: return 1 # 转二进制字符 s = bin(n)[2:] # 反转后的字符

算法

Hailin

NO.54 螺旋矩阵

力扣 No.54 螺旋数组def spiralOrder(matrix: list[list[int]]) -> list[int]: di = [(0, 1), (1, 0), (0, -1), (-1, 0)] idx = 0 m, n = len(matrix), len(matrix[0]) vis = [[False] * n for _ in ra