问题描述:
代码:
class Solution {
public int[] intersect(int[] nums1, int[] nums2) {
if(nums1.length<nums2.length)
return intersect(nums2,nums1);
HashMap<Integer,Integer> hx=new HashMap<Integer,Integer>();
int w=0;
for(int num:nums1){
int count=hx.getOrDefault(num,0)+1;
hx.put(num,count);
}
int []newC=new int[nums1.length];
for(int num2:nums2){
if(hx.containsKey(num2)){
newC[w++]=num2;
int ww=hx.get(num2);
ww--;
if(ww>0){
hx.put(num2,ww);
}else{
hx.remove(num2);
}
}
}
return Arrays.copyOfRange(newC, 0, w);
}
}
思路:
问题描述:
代码:
public class Solution {
public int maxProfit(int prices[]) {
int maxprofit = 0;
int min=prices[0];
for (int i = 1; i < prices.length ; i++) {
if (prices[i] < min) {
min = prices[i];
}else{
int profit = prices[i] - min;
if (profit > maxprofit) {
maxprofit = profit;
}
}
}
return maxprofit;
}
}
思路: