代码随想录算法训练营第三十六天| ● 435. 无重叠区间 ● 763.划分字母区间 ● 56. 合并区间

435. 无重叠区间

class Solution:
    def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
        intervals.sort(key=lambda x:x[0])
        count=0
        for i in range(1,len(intervals)):
            if(intervals[i][0]<intervals[i-1][1]):
                count+=1
                intervals[i][1]=min(intervals[i][1],intervals[i-1][1])
        return count

763.划分字母区间 

#伪代码
int hash[27]={0};
#统计每个字母出现的最远位置 妙啊
for(i=0;i<s.size();i++){
  hash[s[i]-'a']=i;
}
vector<int> resut;
int left=0,right=0;
for(i=0;i<s.size();i++){
  right=max(right,hash[s[i]-'a']);
  if(i==right){
    result.push_back(right-left+1);
    left=i+1;
}
}
return result

class Solution:
    def partitionLabels(self, s: str) -> List[int]:
        left=0
        right=0
        hashmap=[0]*27
        #统计字母出现的最远位置
        for i in range(len(s)):
            hashmap[ord(s[i])-ord('a')]=i
        
        result=[]
        for i in range(len(s)):
            right=max(right,hashmap[ord(s[i])-ord('a')])
            if(i==right):
                result.append(right-left+1)
                left=i+1
        return result

56. 合并区间 

#伪代码
vector<vector<int>> result;
if(intervals.size(0==0) return result;
sort(intervals.begin().intervals.end(),cmp);
result.push_back(intervals[0]);
for(i=1.i<intervals.size();i++){
  if(intervals[i][0]<=result.back()[1]){
    result.back()[1]=max(intervals[i][1],result.back()[1]);
  }
  else:
    result.push_back(intervals[i]);
}
return result

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        intervals.sort(key=lambda x:x[0])
        result=[]
        for i in range(1,len(intervals)):
            if(intervals[i][0]>intervals[i-1][1]):
                result.append(intervals[i-1])
            else:
                intervals[i][1]=max(intervals[i-1][1],intervals[i][1])
                intervals[i][0]=min(intervals[i-1][0],intervals[i][0])
        result.append(intervals[-1])
        return result

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        intervals.sort(key=lambda x:x[0])
        result=[]
        result.append(intervals[0])
        for i in range(1,len(intervals)):
            if(intervals[i][0]<=result[-1][1]):
                result[-1][1]=max(intervals[i][1],result[-1][1])
            else:
                result.append(intervals[i])
        return result