leetcode::largest_number_at_least_twice_of_others::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	dominantIndex (vector< int > &nums)

详细描述

在文件 leetcode.h 第 413 行定义.

成员函数说明

dominantIndex()

int leetcode::largest_number_at_least_twice_of_others::Solution::dominantIndex ( vector< int > &  nums )

static

在文件 leetcode.cpp 第 943 行定义.

                                                     {
            if(nums.size() < 2) {
                return 0;
            }
            unsigned int max;
            unsigned int index;
            unsigned int second;
            if(nums[0] < nums[1]) {
                max    = nums[1];
                index  = 1;
                second = nums[0];
            } else {
                max    = nums[0];
                index  = 0;
                second = nums[1];
            }
            for(int i = 2; i < nums.size(); i++) {
                if(nums[i] > max) {
                    second = max;
                    index  = i;
                    max    = nums[i];
                } else if(nums[i] > second) {
                    second = nums[i];
                }
            }
            if(max >= 2 * second) {
                return index;
            }
            return -1;
        }

被这些函数引用 leetcode::largest_number_at_least_twice_of_others::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp