LintCode 479: Second Max of Array

479. Second Max of Array
     Find the second max number in a given array.

Example
Given [1, 3, 2, 4], return 3.

Given [1, 2], return 1.

Notice
You can assume the array contains at least two numbers.

解法：
注意 "else if (secMax <= nums[i])"是必须要的。
注意 input example [1, -1, -2].

class Solution {
public:
    /**
     * @param nums: An integer array
     * @return: The second max number in the array.
     */
    int secondMax(vector<int> &nums) {
        int max = INT_MIN;
        int secMax = INT_MIN;
        
        int len = nums.size();
        
        for (int i = 0; i < len; ++i) {
            if (max <= nums[i]) {
                secMax = max;
                max = nums[i];
            } else if (secMax <= nums[i]) {
                secMax = nums[i];
            }
        }
        
        return secMax;
    }
};