问题描述:
代码:
class Solution {
public void sortColors(int[] nums) {
Map<Integer,Integer> hx = new HashMap<>();
for(int num:nums){
int count=hx.getOrDefault(num,0)+1;
hx.put(num,count);
}
int i=0;
if(hx.containsKey(0)){
while(hx.get(0)!=0)
{
nums[i++]=0;
int c=hx.get(0)-1;
if(c!=0){
hx.put(0,c);
}else{
break;
}
}
}
if(hx.containsKey(1)){
while(hx.get(1)!=0)
{
nums[i++]=1;
int c1=hx.get(1)-1;
if(c1!=0){
hx.put(1,c1);
}else{
break;
}
}
}
if(hx.containsKey(2)){
while(hx.get(2)!=0)
{
nums[i++]=2;
int c2=hx.get(2)-1;
if(c2!=0){
hx.put(2,c2);
}else{
break;
}
}
}
}
}
思路: HashMap yyds
问题描述:
代码:
class Solution {
public int[][] merge(int[][] intervals) {
if (intervals.length == 0) {
return null;
}
Arrays.sort(intervals, new Comparator<int[]>() {
public int compare(int[] interval1, int[] interval2) {
return interval1[0] - interval2[0];
}
});
List<int[]> merged = new ArrayList<int[]>();
for (int i = 0; i < intervals.length; ++i) {
int L = intervals[i][0], R = intervals[i][1];
if (merged.size() == 0 || merged.get(merged.size() - 1)[1] < L) {
merged.add(new int[]{L, R});
} else {
merged.get(merged.size() - 1)[1] = Math.max(merged.get(merged.size() - 1)[1], R);
}
}
return merged.toArray(new int[merged.size()][]);
}
}
思路:
lambada表达式力扣https://leetcode-cn.com/problems/merge-intervals/solution/he-bing-qu-jian-by-leetcode-solution/