feat: add java solution to lc probolem: No.747.Largest Number At Least Twice of Others (doocs#542)

0xcaffebabe · web-flow · commit dc07f3bf33c0 · 2021-08-03T22:29:29.000+08:00
diff --git a/solution/0700-0799/0747.Largest Number At Least Twice of Others/README.md b/solution/0700-0799/0747.Largest Number At Least Twice of Others/README.md
@@ -58,7 +58,20 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+  public int dominantIndex(int[] nums) {
+    int maxIndex = 0;
+    for (int i = 0; i < nums.length; i++) {
+      if (nums[i] > nums[maxIndex])
+        maxIndex = i;
+    }
+    for (int i = 0; i < nums.length; i++) {
+      if (nums[i] * 2 > nums[maxIndex] && i != maxIndex)
+        return -1;
+    }
+    return maxIndex;
+  }
+}
 ```
 
 ### **...**
diff --git a/solution/0700-0799/0747.Largest Number At Least Twice of Others/README_EN.md b/solution/0700-0799/0747.Largest Number At Least Twice of Others/README_EN.md
@@ -50,7 +50,20 @@ The index of value 6 is 1, so we return 1.
 ### **Java**
 
 ```java
-
+class Solution {
+  public int dominantIndex(int[] nums) {
+    int maxIndex = 0;
+    for (int i = 0; i < nums.length; i++) {
+      if (nums[i] > nums[maxIndex])
+        maxIndex = i;
+    }
+    for (int i = 0; i < nums.length; i++) {
+      if (nums[i] * 2 > nums[maxIndex] && i != maxIndex)
+        return -1;
+    }
+    return maxIndex;
+  }
+}
 ```
 
 ### **...**
diff --git a/solution/0700-0799/0747.Largest Number At Least Twice of Others/Solution.java b/solution/0700-0799/0747.Largest Number At Least Twice of Others/Solution.java
@@ -0,0 +1,14 @@
+class Solution {
+  public int dominantIndex(int[] nums) {
+    int maxIndex = 0;
+    for (int i = 0; i < nums.length; i++) {
+      if (nums[i] > nums[maxIndex])
+        maxIndex = i;
+    }
+    for (int i = 0; i < nums.length; i++) {
+      if (nums[i] * 2 > nums[maxIndex] && i != maxIndex)
+        return -1;
+    }
+    return maxIndex;
+  }
+}
