third max number

Author: fishercoder1534

EASY/src/easy/ThirdMaximumNumber.java

@@ -0,0 +1,57 @@
+package easy;
+
+public class ThirdMaximumNumber {
+
+    public static int thirdMax_20161115(int[] nums) {
+
+        if (nums == null || nums.length == 0) return 0;
+        if (nums.length < 3) {
+           int max = 0;
+           for (int i : nums) {
+               max = Math.max(i, max);
+           }
+           return max;
+        }
+        
+        long first = Long.MIN_VALUE, second = Long.MIN_VALUE, third = Long.MIN_VALUE;
+        
+        for (int i = 0; i < nums.length; i++){
+            if (nums[i] > first) {
+                long tmpFirst = first;
+                first = nums[i];
+                
+                long tmpSecond = second;
+                second = tmpFirst;
+                
+                third = tmpSecond;
+            } else if (nums[i] == first) continue;
+            else if (nums[i] > second) {
+                long tmpSecond = second;
+                second = nums[i];
+                
+                third = tmpSecond;
+            } else if (nums[i] == second) continue; 
+            else if (nums[i] > third) {
+                third = nums[i];
+            }
+        }
+        
+        if (third == Long.MIN_VALUE){
+           return (int) first;
+        }
+        
+        return (int) third;
+    
+    }
+    
+    public static void main(String...strings){
+//        int[] nums = new int[]{1,2};
+//        int[] nums = new int[]{2,2,3,1};
+//        int[] nums = new int[]{1,1,2};//should be 2
+        int[] nums = new int[]{1,2,-2147483648};//should be -2147483648
+//        int[] nums = new int[]{3,2,1};
+//        System.out.println(thirdMax(nums));
+        System.out.println(thirdMax_20161115(nums));
+    }
+
+}

README.md

@@ -12,6 +12,7 @@
 |419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)|[Solution](../../blob/master/MEDIUM/src/medium/BattleshipsinaBoard.java) | O(n^2) |O(1) | Medium| DFS
 |417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)|[Solution](../../blob/master/MEDIUM/src/medium/PacificAtlanticWaterFlow.java) | O(m*n*Max(m,n)) |O(m*n) | Medium| DFS
 |415|[Add Strings](https://leetcode.com/problems/add-strings/)|[Solution](../../blob/master/EASY/src/easy/AddStrings.java)| O(n)|O(1) | Easy|
+|414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)|[Solution](../../blob/master/EASY/src/easy/ThirdMaximumNumber.java)| O(n)|O(1) | Easy|
 |413|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)|[Solution](../../blob/master/MEDIUM/src/medium/ArithmeticSlices.java) | O(n) |O(1) | Medium| DP
 |412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)|[Solution](../../blob/master/EASY/src/easy/FizzBuzz.java)| O(n)|O(1) | Easy|
 |404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)|[Solution](../../blob/master/EASY/src/easy/SumofLeftLeaves.java)| O(n)|O(h) | Easy|