LeetCode第四天

class Solution {
    public int maximumProduct(int[] nums) {
        Arrays.sort(nums);
        return (nums[0]*nums[1]*nums[nums.length-1])>(nums[nums.length-1]*nums[nums.length-2]*nums[nums.length-3])?(nums[0]*nums[1]*nums[nums.length-1]):(nums[nums.length-1]*nums[nums.length-2]*nums[nums.length-3]);
    }
}

class Solution {
    public int thirdMax(int[] nums) {
        Integer first = null ,second = null,third = null;
        for(Integer n : nums){
            if(n.equals(first)||n.equals(second)||n.equals(third)) continue;
            if(first==null||n>first){
                third = second;
                second = first;
                first = n;
            }else if(second == null||n>second){
                third = second;
                second = n;
            }else if(third == null||n>third){
                third = n;
            }
    
        }
        
        return third == null?first:third;
    }
        
}

class Solution {
    public double findMaxAverage(int[] nums, int k) {
        double window = 0;
        double maxAvg = 0;
        for(int i =0;i<k;i++){
            window +=nums[i];
            maxAvg = window;
        }
            
        for(int i = k;i<nums.length;i++){
            window = window+nums[i]-nums[i-k];
            maxAvg = Math.max(maxAvg,window);
        
        }
            
            
        return maxAvg/k;
    }
}

class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        List<Integer> result = new ArrayList<Integer>();
        for(int i =0;i<nums.length;i++){
            
            nums[Math.abs(nums[i])-1] = -1 * Math.abs(nums[Math.abs(nums[i])-1]); 
        }
        for(int i =0;i<nums.length;i++){
            if(nums[i]>0)
                result.add(i+1);
        }
        return result;
    }
}

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int max = 0;
        int times = 0;
        for(int i =0;i<nums.length;i++){
            if(nums[i]==1){
                times++;
                max = Math.max(max,times);
            }else{
                times = 0;
            }
        }
        return max;
    }
}

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        while(n > 0){
            if(m>0)
                nums1[n+m-1] = nums1[m-1]>nums2[n-1]?nums1[--m]:nums2[--n];
            else
                nums1[n-1] = nums2[--n];
        }
    }
}

class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        int count = 0;
        for(int i =0;i<flowerbed.length;i++){
            if(flowerbed[i]==0&&(i==0||flowerbed[i-1]==0)&&(i==flowerbed.length-1||flowerbed[i+1]==0)){
                count++;
                flowerbed[i]=1;
                if(count==n)
                    return true;
            }
        }
        return count >= n;
    }
}