Markland_l的博客

122.股票买卖的最佳时机iifunc maxProfit(prices []int) (ans int) { for i := 1; i<len(prices); i++ { ans += max(0, prices[i] - prices[i-1]) } return}func max(a,b int) int{ if a>b { return a } else { return b }

763.划分字母区间func partitionLabels(s string) (partition []int) { lastPos := [26]int{} for i,c := range s{ lastPos[c-'a'] = i } start,end := 0,0 for i,c := range s{ if lastPos[c-'a'] > end{ end = lastPos[c-'a'

452.用最少的箭射爆气球func findMinArrowShots(points [][]int) int { if len(points) { return 0 } sort.Slice(points, func(i,j int) bool{return points[i][1]<points[j][1]}) maxRes := points[0][1] ans = 1 for _,p := range points{

605.种花问题class Solution: def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool: l = len(flowerbed) news = [0] * (l+2) ans = 0 for i in range(1,l+1): news[i] = flowerbed[i-1] for i in rang

435.无重叠区间class Solution: def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int: if not intervals: return 0 intervals.sort(key = lambda x:x[1]) n = len(intervals) right = intervals[0]

135.分糖果class Solution: def candy(self, ratings: List[int]) -> int: n = len(ratings); if n==0 : return 0 #初始化数组,每个人最少有一个糖果 nums = [1] * n #从左到右遍历一次进行比较 for i in range(1,n): if ratings[i] &g

455分发饼干class Solution: def findContentChildren(self, g: List[int], s: List[int]) -> int: ans = 0 i,j = 0,0 # 先排序 g.sort() s.sort() # 贪心算法，尽可能用最小的饼干去满足每一个小孩 while i<len(g) and j<len(s):