Leetcode入门学习笔记

tripper1412

已于 2023-09-14 22:38:22 修改

阅读量42

点赞数

文章标签： leetcode 学习笔记

于 2023-09-12 22:02:12 首次发布

本文链接：https://blog.csdn.net/qq_38793315/article/details/132840944

版权

Python新手_还需改进

Leetcode_2235_两整数相加_Python

class Solution:
    def sum(self, num1: int, num2: int) -> int:
        return num1 + num2

Leetcode_1929_数组串联_Python

class Solution:
    def getConcatenation(self, nums: List[int]) -> List[int]:
        return nums + nums

Leetcode_0771_宝石与石头_Python

class Solution:
    def numJewelsInStones(self, jewels: str, stones: str) -> int:
        flag = 0
        for i in jewels:
            for j in stones:
                if i == j:
                    flag += 1
        return flag

Leetcode_1480_一维数组的动态和_Python

class Solution:
    def runningSum(self, nums: List[int]) -> List[int]:
        num1 = [nums[0]]
        for i in range(1,len(nums)):
            n = num1[i-1] + nums[i]
            num1.append(n)
        return num1

Leetcode_0709_转换成小写字母_Python

class Solution:
    def toLowerCase(self, s: str) -> str:
        return s.lower()

Leetcode_0771_最富有客户的资产总量_Python

class Solution:
    def maximumWealth(self, accounts: List[List[int]]) -> int:
        nums = []
        m = len(accounts)
        for i in range(0,m):
            sum = 0
            n = len(accounts[i])
            for j in range(0,n):
                sum += accounts[i][j]
            nums.append(sum)
        return max(nums)

Leetcode_66_加一(数组较长时输出失败)

class Solution:
    def plusOne(self, digits: List[int]) -> List[int]:
        num = 0
        for i in digits:
            num = 10*num + i
        digits = []    
        num += 1
        while num > 0:
            digits = [num%10] + digits
            num = int(num/10)
        return digits

leetcode_0724_寻找数组的中心下标

class Solution:
    def pivotIndex(self, nums: List[int]) -> int:
        n = len(nums)
        sum1 = 0
        for i in nums:
            sum1 += i
        sum_num = 0
        for i in range(n):
            if sum_num == sum1 - nums[i]:
                return i
            else:    
                sum_num += nums[i]
                sum1 -= nums[i]
        return -1

Leetcode_0189_轮转数组

（卡了一下）

Leetcode_0048_旋转图像

(暂时还没想出来)

Leetcode_0054_螺旋矩阵

（暂时还没想出来）

Leetcode_0498_对角线遍历

（暂时还没想出来）