435. 无重叠区间
sort using 右区间!!!!!
C++解法
class Solution {
public:
static bool cmp (const vector<int>& a, const vector<int>& b) {
return a[1] < b[1];
}
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end(), cmp);
int num = 0;
for (int i = 1; i < intervals.size(); i++){
if (intervals[i][0] < intervals[i-1][1]){
num++;
intervals[i][1] = intervals[i-1][1];
}
}
return num;
}
};
Python解法
class Solution:
def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
intervals.sort(key=lambda x: x[1])
delete_interval = 0
for i in range(1, len(intervals)):
if intervals[i][0] < intervals[i-1][1]:
delete_interval += 1
intervals[i][1] = intervals[i-1][1]
return delete_interval
763.划分字母区间
C++解法
class Solution {
public:
vector<int> partitionLabels(string s) {
int hash[27] = {0};
for (int i = 0; i < s.size(); i++){
hash[s[i] - 'a'] = i;
}
vector<int> result;
int left = 0;
int right = 0;
for (int 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;
}
};
Python解法
class Solution:
def partitionLabels(self, s: str) -> List[int]:
hash = {}
for i, char in enumerate(s):
hash[char] = i
result = []
left = 0
right = 0
for i, char in enumerate(s):
right = max(right, hash[char])
if i == right:
result.append(right - left + 1)
left = i + 1
return result
56. 合并区间
C++解法
class Solution {
public:
static bool cmp(vector<int>& a, vector<int>& b){
return a[0] < b[0];
}
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end(), cmp);
vector<vector<int>> result;
result.push_back(intervals[0]);
for (int i = 0; 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;
}
};
Python解法
class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
intervals.sort(key=lambda x: (x[0], x[1]))
print(intervals)
result = [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
Day 6 复习
242.有效的字母异位词
class Solution {
public:
bool isAnagram(string s, string t) {
int letter[26] = {0};
for (int i = 0; i < s.size(); i++){
letter[s[i] - 'a']++;
}
for (int i = 0; i < t.size(); i++){
letter[t[i] - 'a']--;
}
for (int i = 0; i < 26; i++){
if (letter[i] != 0){
return false;
}
}
return true;
}
};
349. 两个数组的交集
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
unordered_set<int> result_set;
unordered_set<int> nums_set(nums1.begin(), nums1.end());
for (int num : nums2){
if (nums_set.find(num) != nums_set.end()){
result_set.insert(num);
}
}
return vector<int>(result_set.begin(), result_set.end());
}
};
202. 快乐数
class Solution {
public:
int getSum(int n) {
int sum = 0;
while (n) {
sum += (n % 10) * (n % 10);
n /= 10;
}
return sum;
}
bool isHappy(int n) {
unordered_set<int> set;
while(1) {
int sum = getSum(n);
if (sum == 1) {
return true;
}
if (set.find(sum) != set.end()) {
return false;
} else {
set.insert(sum);
}
n = sum;
}
}
};
1. 两数之和
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> record;
for (int i = 0; i < nums.size(); i++){
if (record.find(target - nums[i]) != record.end()){
return {i, record.find(target-nums[i])->second};
} else {
record.insert(pair<int, int>{nums[i], i});
}
}
return {};
}
};