feat: add solutions to lc problem: No.2057

No.2057.Smallest Index With Equal Value

Author: yanglbme

solution/2000-2099/2057.Smallest Index With Equal Value/README.md

@@ -69,15 +69,29 @@ i=3: 3 mod 10 = 3 != nums[3].
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def smallestEqual(self, nums: List[int]) -> int:
+        for i, v in enumerate(nums):
+            if i % 10 == v:
+                return i
+        return -1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int smallestEqual(int[] nums) {
+        for (int i = 0; i < nums.length; ++i) {
+            if (i % 10 == nums[i]) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -91,6 +105,33 @@ function smallestEqual(nums: number[]): number {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int smallestEqual(vector<int>& nums) {
+        for (int i = 0; i < nums.size(); ++i)
+            if (i % 10 == nums[i])
+                return i;
+        return -1;
+    }
+};
+```
+
+### **Go**
+
+```go
+func smallestEqual(nums []int) int {
+	for i, v := range nums {
+		if i%10 == v {
+			return i
+		}
+	}
+	return -1
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2057.Smallest Index With Equal Value/README_EN.md

@@ -57,13 +57,27 @@ i=3: 3 mod 10 = 3 != nums[3].
 ### **Python3**
 
 ```python
-
+class Solution:
+    def smallestEqual(self, nums: List[int]) -> int:
+        for i, v in enumerate(nums):
+            if i % 10 == v:
+                return i
+        return -1
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int smallestEqual(int[] nums) {
+        for (int i = 0; i < nums.length; ++i) {
+            if (i % 10 == nums[i]) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -77,6 +91,33 @@ function smallestEqual(nums: number[]): number {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int smallestEqual(vector<int>& nums) {
+        for (int i = 0; i < nums.size(); ++i)
+            if (i % 10 == nums[i])
+                return i;
+        return -1;
+    }
+};
+```
+
+### **Go**
+
+```go
+func smallestEqual(nums []int) int {
+	for i, v := range nums {
+		if i%10 == v {
+			return i
+		}
+	}
+	return -1
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2057.Smallest Index With Equal Value/Solution.go

@@ -0,0 +1,8 @@
+func smallestEqual(nums []int) int {
+	for i, v := range nums {
+		if i%10 == v {
+			return i
+		}
+	}
+	return -1
+}

solution/2000-2099/2057.Smallest Index With Equal Value/Solution.java

@@ -0,0 +1,10 @@
+class Solution {
+    public int smallestEqual(int[] nums) {
+        for (int i = 0; i < nums.length; ++i) {
+            if (i % 10 == nums[i]) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}

solution/2000-2099/2057.Smallest Index With Equal Value/Solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def smallestEqual(self, nums: List[int]) -> int:
+        for i, v in enumerate(nums):
+            if i % 10 == v:
+                return i
+        return -1