edit 414

fishercoder1534 · fishercoder1534 · commit f6cb812c881b · 2017-07-15T17:08:16.000-07:00
diff --git a/README.md b/README.md
@@ -177,7 +177,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PacificAtlanticWaterFlow.java) | O(m*n*Max(m,n)) |O(m*n) | Medium| DFS
 |416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_416.java)| O(m*n)|O(m*n) | Medium | DP
 |415|[Add Strings](https://leetcode.com/problems/add-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_415.java)| O(n)|O(1) | Easy|
-|414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ThirdMaximumNumber.java)| O(n)|O(1) | Easy|
+|414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_414.java)| O(n)|O(1) | Easy|
 |413|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_413.java) | O(n) |O(1) | Medium| DP
 |412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FizzBuzz.java)| O(n)|O(1) | Easy|
 |411|[Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_411.java)| O(?)|O(?) | Hard| NP-Hard, Backtracking, Trie, Recursion
diff --git a/src/main/java/com/fishercoder/solutions/_414.java b/src/main/java/com/fishercoder/solutions/_414.java
@@ -1,6 +1,10 @@
 package com.fishercoder.solutions;
 
-/**Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).
+/**
+ * 414. Third Maximum Number
+ *
+ * Given a non-empty array of integers, return the third maximum number in this array.
+ * If it does not exist, return the maximum number. The time complexity must be in O(n).
 
  Example 1:
  Input: [3, 2, 1]
@@ -22,9 +26,9 @@
  Explanation: Note that the third maximum here means the third maximum distinct number.
  Both numbers with value 2 are both considered as second maximum.
  */
-public class ThirdMaximumNumber {
+public class _414 {
 
-    public static int thirdMax_20161115(int[] nums) {
+    public static int thirdMax(int[] nums) {
 
         if (nums == null || nums.length == 0) return 0;
         if (nums.length < 3) {
@@ -73,7 +77,7 @@ public static void main(String...strings){
         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));
+        System.out.println(thirdMax(nums));
     }
 
 }
