Open Shawngbk opened 7 years ago
public class Solution { public int thirdMax(int[] nums) { Arrays.sort(nums); if(nums.length <= 2) return nums[nums.length-1]; int count = 1; for(int i = nums.length-1; i > 0; i--) { if(nums[i] != nums[i-1]) count++; if(count == 3) return nums[i-1]; } return nums[nums.length-1]; } }
Amazon
public class Solution { public int thirdMax(int[] nums) { Arrays.sort(nums); if(nums.length <= 2) return nums[nums.length-1]; int count = 1; for(int i = nums.length-1; i > 0; i--) { if(nums[i] != nums[i-1]) count++; if(count == 3) return nums[i-1]; } return nums[nums.length-1]; } }