解法一,暴力搜索所有可能的起点,超时,通过测试样例34/40。
class Solution:
def canfini(self, gas, cost, start):
n = len(gas)
curgas = gas[start]
cnt = 0
while curgas >= cost[start]:
curgas -= cost[start]
start = (start+1) % n
curgas += gas[start]
cnt += 1
if cnt >= n:
return True
return False
def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
n = len(gas)
for start in range(n):
if self.canfini(gas, cost, start):
return start
return -1
解法二
class Solution:
def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
#sol1
cursum = 0
minsum = float("inf")
for i in range(len(gas)):
cursum += gas[i] - cost[i]
minsum = min(minsum, cursum)
if cursum < 0:
return -1
if minsum >= 0:
return 0
if minsum < 0:
for i in range(len(gas)-1, -1, -1):
minsum += gas[i] - cost[i]
if minsum >= 0:
return i
return -1
解法三
class Solution:
def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int:
#sol2
start = 0
cursum = 0
totalsum = 0
for i in range(len(gas)):
cursum += gas[i] - cost[i]
totalsum += gas[i] - cost[i]
if cursum < 0:
start = i + 1
cursum = 0
if totalsum < 0 or start >= len(gas):
return -1
return start
从左到右遍历一次:处理右边比左边高的情况;从右到左遍历一次:处理左边比右边高的情况。
时间和空间都是O(n)。
class Solution:
def candy(self, ratings: List[int]) -> int:
n = len(ratings)
candies = [1 for _ in range(n)]
for i in range(1, n):
if ratings[i-1] < ratings[i]:
candies[i] = 1 + candies[i-1]
for j in range(n-2, -1, -1):
if ratings[j] > ratings[j+1]:
candies[j] = max(candies[j], candies[j+1] + 1)
return sum(candies)
* 如果遇到20,应该优先找零10+5而非3*5,因为5比10更好用。这个处理是局部最优。
class Solution:
def lemonadeChange(self, bills: List[int]) -> bool:
cur = {}
for key in [5, 10, 20]:
cur[key] = 0
for bill in bills:
if bill == 5:
cur[5] += 1
if bill == 10:
if cur[5] == 0:
return False
else:
cur[5] -= 1
cur[10] += 1
if bill == 20:
if cur[10] and cur[5]:
cur[5] -= 1
cur[10] -= 1
cur[20] += 1
elif cur[5] >= 3:
cur[5] -= 3
cur[20] += 1
else:
return False
return True
先按身高从大到小排序:向sort函数传入key参数 lambda x : (-x[0], x[1]),表示优先按people中的元素x的x[0],即身高从大到小排序,若身高一样则按k值从小到大排序。接着从左往右遍历排好序的people,将当前元素插入队列(用list)下标为p[1]位置。由于当前元素前面的元素都不小于它,这种插入方式能保证满足当前元素的k而且不破坏前面已遍历过元素的k。
class Solution:
def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
people.sort(key = lambda x: (-x[0], x[1]))
que = []
for p in people:
que.insert(p[1], p)
return que