在一个 m*n 的棋盘的每一格都放有一个礼物,每个礼物都有一定的价值(价值大于 0)。你可以从棋盘的左上角开始拿格子里的礼物,并每次向右或者向下移动一格、直到到达棋盘的右下角。给定一个棋盘及其上面的礼物的价值,请计算你最多能拿到多少价值的礼物?
class Solution:
def maxValue(self, grid: List[List[int]]) -> int:
m, n = len(grid), len(grid[0])
dp = [[0 for i in range(n)]for j in range(m)]
dp[0][0]=grid[0][0]
for i in range(1,n):
dp[0][i] = dp[0][i-1]+grid[0][i]
for j in range(1,m):
dp[j][0] = dp[j-1][0]+grid[j][0]
for i in range(1,n):
for j in range(1,m):
dp[j][i] = max(dp[j-1][i],dp[j][i-1])+grid[j][i]
return dp[m-1][n-1]
请从字符串中找出一个最长的不包含重复字符的子字符串,计算该最长子字符串的长度。
滑动窗口,好像有更快的方法,不想看了下次再看
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
if not s:return 0
if len(s)==1:return 1
max = 0
le, ri = 0, 0
slen = len(s)
while ri < slen-1:
ri += 1
while s[ri] in s[le:ri]:
le += 1
newlen = ri-le+1
if newlen>max: max=newlen
return max
我们把只包含质因子 2、3 和 5 的数称作丑数(Ugly Number)。求按从小到大的顺序的第 n 个丑数。
class Solution:
def nthUglyNumber(self, n: int) -> int:
if n==1:return 1
ug = [1]
a,b,c = 0,0,0
while len(ug)<n:
mincur = a
min = 2*ug[a]
if 3*ug[b]<min:
mincur = b
min = 3*ug[b]
elif 3*ug[b]==min:
b+=1
if 5*ug[c]<min:
mincur = c
min = 5*ug[c]
elif 5*ug[c]==min:
c+=1
ug.append(min)
if mincur == a:a+=1
elif mincur == b:b+=1
elif mincur == c:c+=1
return ug[-1]
xs第一次用滑动窗口,思想其实差不多,但是题解用的抓住了结果只会从三个里面产生,比滑动窗口简单了好多
class Solution:
def nthUglyNumber(self, n: int) -> int:
if n==1:return 1
ug = [1]
dic = {}
dic[ug[0]]=[2,3,5]
le, ri = 0, 0
while len(ug)<n:
cur = le
mincur = cur
min = ug[cur]*dic[ug[cur]][0]
while cur<=ri:
if ug[cur]*dic[ug[cur]][0]<min:
min = ug[cur]*dic[ug[cur]][0]
mincur = cur
elif ug[cur]*dic[ug[cur]][0]==min and cur>le:
del dic[ug[cur]][0]
cur += 1
ug.append(min)
dic[ug[-1]]=[2,3,5]
del dic[ug[mincur]][0]
if not dic[ug[le]]: le += 1
if dic[ug[ri]][0] != 2: ri += 1
print(ug)
return ug[-1]