feat: add solutions to lc problem: No.1848

yanglbme · yanglbme · commit 50384df39ae6 · 2023-03-31T09:38:37.000+08:00
No.1848.Minimum Distance to the Target Element
diff --git a/solution/1800-1899/1848.Minimum Distance to the Target Element/README.md b/solution/1800-1899/1848.Minimum Distance to the Target Element/README.md
@@ -53,6 +53,12 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：一次遍历**
+
+遍历数组，找到所有等于 `target` 的下标，然后计算 `abs(i - start)`，取最小值即可。
+
+时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为数组 `nums` 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -62,11 +68,11 @@
 ```python
 class Solution:
     def getMinDistance(self, nums: List[int], target: int, start: int) -> int:
-        res = inf
-        for i, num in enumerate(nums):
-            if num == target:
-                res = min(res, abs(i - start))
-        return res
+        ans = inf
+        for i, x in enumerate(nums):
+            if x == target:
+                ans = min(ans, abs(i - start))
+        return ans
 ```
 
 ### **Java**
@@ -76,13 +82,14 @@ class Solution:
 ```java
 class Solution {
     public int getMinDistance(int[] nums, int target, int start) {
-        int res = Integer.MAX_VALUE;
-        for (int i = 0; i < nums.length; ++i) {
+        int n = nums.length;
+        int ans = n;
+        for (int i = 0; i < n; ++i) {
             if (nums[i] == target) {
-                res = Math.min(res, Math.abs(i - start));
+                ans = Math.min(ans, Math.abs(i - start));
             }
         }
-        return res;
+        return ans;
     }
 }
 ```
@@ -93,17 +100,39 @@ class Solution {
 class Solution {
 public:
     int getMinDistance(vector<int>& nums, int target, int start) {
-        int res = nums.size();
-        for (int i = 0; i < nums.size(); ++i) {
+        int n = nums.size();
+        int ans = n;
+        for (int i = 0; i < n; ++i) {
             if (nums[i] == target) {
-                res = min(res, abs(i - start));
+                ans = min(ans, abs(i - start));
             }
         }
-        return res;
+        return ans;
     }
 };
 ```
 
+### **Go**
+
+```go
+func getMinDistance(nums []int, target int, start int) int {
+	ans := 1 << 30
+	for i, x := range nums {
+		if t := abs(i - start); x == target && t < ans {
+			ans = t
+		}
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x < 0 {
+		return -x
+	}
+	return x
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1800-1899/1848.Minimum Distance to the Target Element/README_EN.md b/solution/1800-1899/1848.Minimum Distance to the Target Element/README_EN.md
@@ -54,25 +54,26 @@
 ```python
 class Solution:
     def getMinDistance(self, nums: List[int], target: int, start: int) -> int:
-        res = inf
-        for i, num in enumerate(nums):
-            if num == target:
-                res = min(res, abs(i - start))
-        return res
+        ans = inf
+        for i, x in enumerate(nums):
+            if x == target:
+                ans = min(ans, abs(i - start))
+        return ans
 ```
 
 ### **Java**
 
 ```java
 class Solution {
     public int getMinDistance(int[] nums, int target, int start) {
-        int res = Integer.MAX_VALUE;
-        for (int i = 0; i < nums.length; ++i) {
+        int n = nums.length;
+        int ans = n;
+        for (int i = 0; i < n; ++i) {
             if (nums[i] == target) {
-                res = Math.min(res, Math.abs(i - start));
+                ans = Math.min(ans, Math.abs(i - start));
             }
         }
-        return res;
+        return ans;
     }
 }
 ```
@@ -83,17 +84,39 @@ class Solution {
 class Solution {
 public:
     int getMinDistance(vector<int>& nums, int target, int start) {
-        int res = nums.size();
-        for (int i = 0; i < nums.size(); ++i) {
+        int n = nums.size();
+        int ans = n;
+        for (int i = 0; i < n; ++i) {
             if (nums[i] == target) {
-                res = min(res, abs(i - start));
+                ans = min(ans, abs(i - start));
             }
         }
-        return res;
+        return ans;
     }
 };
 ```
 
+### **Go**
+
+```go
+func getMinDistance(nums []int, target int, start int) int {
+	ans := 1 << 30
+	for i, x := range nums {
+		if t := abs(i - start); x == target && t < ans {
+			ans = t
+		}
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x < 0 {
+		return -x
+	}
+	return x
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1800-1899/1848.Minimum Distance to the Target Element/Solution.cpp b/solution/1800-1899/1848.Minimum Distance to the Target Element/Solution.cpp
@@ -1,12 +1,13 @@
 class Solution {
 public:
     int getMinDistance(vector<int>& nums, int target, int start) {
-        int res = nums.size();
-        for (int i = 0; i < nums.size(); ++i) {
+        int n = nums.size();
+        int ans = n;
+        for (int i = 0; i < n; ++i) {
             if (nums[i] == target) {
-                res = min(res, abs(i - start));
+                ans = min(ans, abs(i - start));
             }
         }
-        return res;
+        return ans;
     }
 };
diff --git a/solution/1800-1899/1848.Minimum Distance to the Target Element/Solution.go b/solution/1800-1899/1848.Minimum Distance to the Target Element/Solution.go
@@ -0,0 +1,16 @@
+func getMinDistance(nums []int, target int, start int) int {
+	ans := 1 << 30
+	for i, x := range nums {
+		if t := abs(i - start); x == target && t < ans {
+			ans = t
+		}
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x < 0 {
+		return -x
+	}
+	return x
+}
diff --git a/solution/1800-1899/1848.Minimum Distance to the Target Element/Solution.java b/solution/1800-1899/1848.Minimum Distance to the Target Element/Solution.java
@@ -1,11 +1,12 @@
 class Solution {
     public int getMinDistance(int[] nums, int target, int start) {
-        int res = Integer.MAX_VALUE;
-        for (int i = 0; i < nums.length; ++i) {
+        int n = nums.length;
+        int ans = n;
+        for (int i = 0; i < n; ++i) {
             if (nums[i] == target) {
-                res = Math.min(res, Math.abs(i - start));
+                ans = Math.min(ans, Math.abs(i - start));
             }
         }
-        return res;
+        return ans;
     }
 }
diff --git a/solution/1800-1899/1848.Minimum Distance to the Target Element/Solution.py b/solution/1800-1899/1848.Minimum Distance to the Target Element/Solution.py
@@ -1,7 +1,7 @@
 class Solution:
     def getMinDistance(self, nums: List[int], target: int, start: int) -> int:
-        res = inf
-        for i, num in enumerate(nums):
-            if num == target:
-                res = min(res, abs(i - start))
-        return res
+        ans = inf
+        for i, x in enumerate(nums):
+            if x == target:
+                ans = min(ans, abs(i - start))
+        return ans

Original file line number	Diff line number	Diff line change
`@@ -1,12 +1,13 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public:`
`3`	`3`	`int getMinDistance(vector<int>& nums, int target, int start) {`
`4`		`- int res = nums.size();`
`5`		`- for (int i = 0; i < nums.size(); ++i) {`
	`4`	`+ int n = nums.size();`
	`5`	`+ int ans = n;`
	`6`	`+ for (int i = 0; i < n; ++i) {`
`6`	`7`	`if (nums[i] == target) {`
`7`		`- res = min(res, abs(i - start));`
	`8`	`+ ans = min(ans, abs(i - start));`
`8`	`9`	`}`
`9`	`10`	`}`
`10`		`- return res;`
	`11`	`+ return ans;`
`11`	`12`	`}`
`12`	`13`	`};`
Original file line number	Diff line number	Diff line change
`@@ -1,11 +1,12 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public int getMinDistance(int[] nums, int target, int start) {`
`3`		`- int res = Integer.MAX_VALUE;`
`4`		`- for (int i = 0; i < nums.length; ++i) {`
	`3`	`+ int n = nums.length;`
	`4`	`+ int ans = n;`
	`5`	`+ for (int i = 0; i < n; ++i) {`
`5`	`6`	`if (nums[i] == target) {`
`6`		`- res = Math.min(res, Math.abs(i - start));`
	`7`	`+ ans = Math.min(ans, Math.abs(i - start));`
`7`	`8`	`}`
`8`	`9`	`}`
`9`		`- return res;`
	`10`	`+ return ans;`
`10`	`11`	`}`
`11`	`12`	`}`