Package g0701_0800.s0747_largest_number_at_least_twice_of_others

Class Solution

java.lang.Object

g0701_0800.s0747_largest_number_at_least_twice_of_others.Solution

public class Solution
extends Object

747 - Largest Number At Least Twice of Others\. Easy You are given an integer array `nums` where the largest integer is **unique**. Determine 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, or return_ `-1` _otherwise_. **Example 1:** **Input:** nums = [3,6,1,0] **Output:** 1 **Explanation:** 6 is the largest integer. For every other number in the array x, 6 is at least 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 is less than twice the value of 3, so we return -1. **Example 3:** **Input:** nums = [1] **Output:** 0 **Explanation:** 1 is trivially at least twice the value as any other number because there are no other numbers. **Constraints:** * `1 <= nums.length <= 50` * `0 <= nums[i] <= 100` * The largest element in `nums` is unique.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	dominantIndex(int[] arr)
int	findNum(int target, int[] arr)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

dominantIndex

public int dominantIndex(int[] arr)

findNum

public int findNum(int target,
 int[] arr)