feat: add solutions to lc problem: No.0747.Largest Number At Least Twice

of Others

Author: yanglbme

solution/0700-0799/0747.Largest Number At Least Twice of Others/README.md

@@ -50,7 +50,16 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def dominantIndex(self, nums: List[int]) -> int:
+        max_idx, n = 0, len(nums)
+        for i in range(1, n):
+            if nums[i] > nums[max_idx]:
+                max_idx = i
+        for i in range(n):
+            if i != max_idx and nums[i] * 2 > nums[max_idx]:
+                return -1
+        return max_idx
 ```
 
 ### **Java**
@@ -74,6 +83,43 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int dominantIndex(vector<int>& nums) {
+        int maxIdx = 0, n = nums.size();
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] > nums[maxIdx]) maxIdx = i;
+        }
+        for (int i = 0; i < n; ++i) {
+            if (i != maxIdx && nums[i] * 2 > nums[maxIdx]) return -1;
+        }
+        return maxIdx;
+    }
+};
+```
+
+### **Go**
+
+```go
+func dominantIndex(nums []int) int {
+	maxIndex, n := 0, len(nums)
+	for i := 1; i < n; i++ {
+		if nums[i] > nums[maxIndex] {
+			maxIndex = i
+		}
+	}
+	for i := 0; i < n; i++ {
+		if i != maxIndex && nums[i]*2 > nums[maxIndex] {
+			return -1
+		}
+	}
+	return maxIndex
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0747.Largest Number At Least Twice of Others/README_EN.md

@@ -44,7 +44,16 @@ The index of value 6 is 1, so we return 1.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def dominantIndex(self, nums: List[int]) -> int:
+        max_idx, n = 0, len(nums)
+        for i in range(1, n):
+            if nums[i] > nums[max_idx]:
+                max_idx = i
+        for i in range(n):
+            if i != max_idx and nums[i] * 2 > nums[max_idx]:
+                return -1
+        return max_idx
 ```
 
 ### **Java**
@@ -66,6 +75,43 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int dominantIndex(vector<int>& nums) {
+        int maxIdx = 0, n = nums.size();
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] > nums[maxIdx]) maxIdx = i;
+        }
+        for (int i = 0; i < n; ++i) {
+            if (i != maxIdx && nums[i] * 2 > nums[maxIdx]) return -1;
+        }
+        return maxIdx;
+    }
+};
+```
+
+### **Go**
+
+```go
+func dominantIndex(nums []int) int {
+	maxIndex, n := 0, len(nums)
+	for i := 1; i < n; i++ {
+		if nums[i] > nums[maxIndex] {
+			maxIndex = i
+		}
+	}
+	for i := 0; i < n; i++ {
+		if i != maxIndex && nums[i]*2 > nums[maxIndex] {
+			return -1
+		}
+	}
+	return maxIndex
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0747.Largest Number At Least Twice of Others/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int dominantIndex(vector<int>& nums) {
+        int maxIdx = 0, n = nums.size();
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] > nums[maxIdx]) maxIdx = i;
+        }
+        for (int i = 0; i < n; ++i) {
+            if (i != maxIdx && nums[i] * 2 > nums[maxIdx]) return -1;
+        }
+        return maxIdx;
+    }
+};

solution/0700-0799/0747.Largest Number At Least Twice of Others/Solution.go

@@ -0,0 +1,14 @@
+func dominantIndex(nums []int) int {
+	maxIndex, n := 0, len(nums)
+	for i := 1; i < n; i++ {
+		if nums[i] > nums[maxIndex] {
+			maxIndex = i
+		}
+	}
+	for i := 0; i < n; i++ {
+		if i != maxIndex && nums[i]*2 > nums[maxIndex] {
+			return -1
+		}
+	}
+	return maxIndex
+}

solution/0700-0799/0747.Largest Number At Least Twice of Others/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def dominantIndex(self, nums: List[int]) -> int:
+        max_idx, n = 0, len(nums)
+        for i in range(1, n):
+            if nums[i] > nums[max_idx]:
+                max_idx = i
+        for i in range(n):
+            if i != max_idx and nums[i] * 2 > nums[max_idx]:
+                return -1
+        return max_idx