GoLang Solution For LeetCode Problem: Third Maximum Number
Solving Third Maximum Number in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: [3, 2, 1] Output: 1 Explanation: The third maximum is 1.
Input: [1, 2] Output: 2 Explanation: The third maximum does not exist, so the maximum (2) is returned instead.
Input: [2, 2, 3, 1] Output: 1 Explanation: Note that the third maximum here means the third maximum distinct number. Both numbers with value 2 are both considered as second maximum.
See the full details of the problem Third Maximum Number at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go