记录了初步解题思路 以及本地实现代码；并不一定为最优 也希望大家能一起探讨 一起进步
目录
9/23 2414. 最长的字母序连续子字符串的长度
def longestContinuousSubstring(s):
"""
:type s: str
:rtype: int
"""
ans = 1
cur = 1
for i in range(1,len(s)):
if ord(s[i])-ord(s[i-1])==1:
cur+=1
else:
cur=1
ans=max(ans,cur)
return ans
9/24 2207. 字符串中最多数目的子序列
def maximumSubsequenceCount(text, pattern):
"""
:type text: str
:type pattern: str
:rtype: int
"""
p0,p1=0,0
ans =0
for c in text:
if c==pattern[1]:
ans += p0
p1+=1
if c==pattern[0]:
p0+=1
return ans+max(p0,p1)
9/25 2306. 公司命名
def distinctNames(ideas):
"""
:type ideas: List[str]
:rtype: int
"""
from collections import defaultdict
m = defaultdict(set)
for s in ideas:
m[s[0]].add(s[1:])
ans = 0
for h1,s1 in m.items():
for h2,s2 in m.items():
if h1==h2:
continue
same = len(s1&s2)
ans +=(len(s1)-same)*(len(s2)-same)
return ans
9/26 2535. 数组元素和与数字和的绝对差
def differenceOfSum(nums):
"""
:type nums: List[int]
:rtype: int
"""
s0=0
s1=0
for num in nums:
s0+=num
while num:
s1+=num%10
num//=10
return s0-s1
9/27 2516. 每种字符至少取 K 个
def takeCharacters(s, k):
"""
:type s: str
:type k: int
:rtype: int
"""
n=len(s)
if n<3*k:
return -1
cnt={'a':0,'b':0,'c':0}
for c in s:
cnt[c]+=1
if cnt['a']<k or cnt['b']<k or cnt['c']<k:
return -1
ans = len(s)
l = 0
for r,c in enumerate(s):
cnt[c]-=1
while l<r and (cnt['a']<k or cnt['b']<k or cnt['c']<k):
cnt[s[l]]+=1
l+=1
if cnt['a']>=k and cnt['b']>=k and cnt['c']>=k:
ans = min(ans,n-(r-l+1))
return ans
9/28 2286. 以组为单位订音乐会的门票
class BookMyShow(object):
def __init__(self, n, m):
"""
:type n: int
:type m: int
"""
self.n = n
self.m = m
self.minT = [0]*(4*n)
self.sumT = [0]*(4*n)
def modify(self,i,l,r,ind,val):
if l==r:
self.minT[i]=val
self.sumT[i]=val
return
mid=(l+r)//2
if ind<=mid:
self.modify(i*2,l,mid,ind,val)
else:
self.modify(i*2+1, mid+1, r, ind, val)
self.minT[i]=min(self.minT[i*2],self.minT[i*2+1])
self.sumT[i]=self.sumT[i*2]+self.sumT[i*2+1]
def queryMin(self,i,l,r,val):
if l==r:
return l if self.minT[i]<=val else self.n
mid = (l+r)//2
if self.minT[i*2]<=val:
return self.queryMin(i*2,l,mid,val)
else:
return self.queryMin(i*2+1,mid+1,r,val)
def querySum(self,i,l,r,l2,r2):
if l2<=l and r<=r2:
return self.sumT[i]
mid=(l+r)//2
s=0
if mid>=l2:
s+=self.querySum(i*2, l, mid, l2, r2)
if mid+1<=r2:
s+=self.querySum(i*2+1, mid+1, r, l2, r2)
return s
def gather(self, k, maxRow):
"""
:type k: int
:type maxRow: int
:rtype: List[int]
"""
i = self.queryMin(1, 0, self.n-1, self.m-k)
if i>maxRow:
return []
used = self.querySum(1, 0, self.n-1, i, i)
self.modify(1, 0, self.n-1, i, used+k)
return [i,used]
def scatter(self, k, maxRow):
"""
:type k: int
:type maxRow: int
:rtype: bool
"""
total = self.querySum(1, 0, self.n-1, 0, maxRow)
if (maxRow+1)*self.m-total<k:
return False
i = self.queryMin(1, 0, self.n-1, self.m-1)
while True:
used = self.querySum(1, 0, self.n-1, i, i)
if self.m-used>=k:
self.modify(1, 0, self.n-1, i, used+k)
break
k-=self.m-used
self.modify(1, 0, self.n-1, i, self.m)
i+=1
return True
9/29 2073. 买票需要的时间
def timeRequiredToBuy(tickets, k):
"""
:type tickets: List[int]
:type k: int
:rtype: int
"""
num=tickets[k]
ans = num
for i in range(k):
ans += min(tickets[i],num)
for i in range(k+1,len(tickets)):
ans += min(tickets[i],num-1)
return ans
