Leobing001的博客

a = 1def fun(a): a += 1 print(a)fun(a)print(a)a = [1]def fun(): a.append(2) print(a)fun()print(a)输出21[1, 2][1, 2]list直接就是全局变量。

class Solution: def nthUglyNumber(self, n): """ :type n: int :rtype: int """ ugly = [1] i2, i3, i5 = 0, 0, 0 for _ in range(2, n + 1): ...

class Solution: def numSquares(self, n): """ :type n: int :rtype: int """# # BFS# # 每一层都减去所有可以减去的平方数，下一层判断所有（x-平方数）# if n < 2:# ...

class Solution: def lengthOfLIS(self, nums): """ :type nums: List[int] :rtype: int """ # dp[i] if not nums: return 0 n...

class NumMatrix: def __init__(self, matrix): """ :type matrix: List[List[int]] """ if not matrix: return None r = len(matrix) c = len(...

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ if not prices or len(prices) == 1: return 0 ...

class Solution: def coinChange(self, coins, amount): """ :type coins: List[int] :type amount: int :rtype: int """ MAX = float('inf') # 初始条件...

class Solution: def countBits(self, num): """ :type num: int :rtype: List[int] """ # 右移一位（之前计算的记录下来）+ 末尾是否是1 num += 1 # 初始条件dp[0] = 0 ...

class Solution: def integerBreak(self, n): """ :type n: int :rtype: int """ dp = [0 for i in range(n+1)] dp[1] = 1 for i in range(2, n+1):...

class Solution: def countNumbersWithUniqueDigits(self, n): """ :type n: int :rtype: int """ # 解法来源https://leetcode.com/problems/count-numbers-with-unique-d...

class Solution: def largestDivisibleSubset(self, nums): """ :type nums: List[int] :rtype: List[int] """ if not nums: return [] if len(n...

如果a = 1b = 2那么，交换a和b的值用python怎么做？如下：a, b = b, a原理是什么？是把 b, a当成了（b, a）元组。但之后本人在学习过程中经常遇到容易混淆的情形，比如：a, b = b, a + b结果是  还是 ? 记住一句话即可：先算右面！ 正确。...

class Solution: def rob(self, nums): """ :type nums: List[int] :rtype: int """ # 将第一家和最后一家分别去掉，用动态规划求出两个最大值，然后较大的那个就是 n = len(nums) if n ==...

class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: str """ # dp ans = '' max_len = 0 n = len(s) DP = ...

class Solution: def uniquePaths(self, m, n): """ :type m: int :type n: int :rtype: int """ # 让初始第一行和第一列为1 dp = [[1] * n for _ in range(m)]...

class Solution: def uniquePathsWithObstacles(self, obstacleGrid): """ :type obstacleGrid: List[List[int]] :rtype: int """ # base cases:第一行第一列为1，但遇到obstacl...

class Solution: def minPathSum(self, grid): """ :type grid: List[List[int]] :rtype: int """ R = len(grid) C = len(grid[0]) dp = [[0] * C fo...

class Solution: def numDecodings(self, s): """ :type s: str :rtype: int """ # 动态规划dp[i]表示s第i个数时decode方式 if s == "": return 0 d...

class Solution: def minimumTotal(self, triangle): """ :type triangle: List[List[int]] :rtype: int """ # dp if not triangle: return 0 ...

最简单快捷的方式：l = list(map(int, input().split()))print(l) 

class Solution: def maximalSquare(self, A): """ :type A: List[List[str]] :rtype: int """ for i in range(len(A)): for j in range(len(A[i])): ...

class Solution: def wordBreak(self, s, wordDict): """ :type s: str :type wordDict: List[str] :rtype: bool """ n = len(s) dp = [False] * (n ...

class Solution: def maxProduct(self, nums): """ :type nums: List[int] :rtype: int """ n = len(nums) maxi = nums[0] dp_min = [0] * n ...

见该说明文档：https://docs.scipy.org/doc/numpy-1.13.0/reference/generated/numpy.split.html尤其值得记忆的是当indices_or_sections是1-D array（比如[2, 3]）时代表的含义。另外，split默认是axis=0，代表沿行分离。...