747. Largest Number At Least Twice of Others[Leetcode从零开刷]

题目来源：

leetcode

---

题目

In a given integer array nums, there is always exactly one largest element.

Find whether the largest element in the array is at least twice as much as every other number in the array.

If it is, return the index of the largest element, otherwise return -1.

• Example 1：

Input: nums = [3, 6, 1, 0]
Output: 1
Explanation: 6 is the largest integer, and for every other number in the array x,
6 is more than twice as big as x.  The index of value 6 is 1, so we return 1.

• Example 2:

Input: nums = [1, 2, 3, 4]
Output: -1
Explanation: 4 isn't at least as big as twice the value of 3, so we return -1.

解答：

题目意思就是如果数组中存在一个数远大于（至少两倍）数组中其他数，则返回该数的index。否则返回-1；
方法比较笨，先复制了一个数组，而且用哈希表记录了数和他的index
排序了新数组，用最后一个和倒数第二个的值来比较这个数组行不行，再取出他的index。

class Solution {
    public int dominantIndex(int[] nums) {
        int N= nums.length;
        if(N==1) return 0;

        int[] a = new int[N];
        HashMap<Integer,Integer> map = new HashMap<>();
        for(int i = 0;i<N;i++){
            map.put(nums[i],i);
            a[i] = nums[i];
        }
        Arrays.sort(a);
        if(a[N-2]*2 <= a[N-1]) return map.get(a[N-1]);
        else return -1;     
    }
}