feat: add solutions to lc problem: No.1228

No.1228.Missing Number In Arithmetic Progression

Author: yanglbme

solution/1200-1299/1228.Missing Number In Arithmetic Progression/README.md

@@ -50,15 +50,62 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def missingNumber(self, arr: List[int]) -> int:
+        n = len(arr)
+        d = (arr[-1] - arr[0]) // n
+        for i in range(1, n):
+            if arr[i] != arr[i - 1] + d:
+                return arr[i - 1] + d
+        return arr[0]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int missingNumber(int[] arr) {
+        int n = arr.length;
+        int d = (arr[n - 1] - arr[0]) / n;
+        for (int i = 1; i < n; ++i) {
+            if (arr[i] != arr[i - 1] + d) {
+                return arr[i - 1] + d;
+            }
+        }
+        return arr[0];
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int missingNumber(vector<int>& arr) {
+        int n = arr.size();
+        int d = (arr[n - 1] - arr[0]) / n;
+        for (int i = 1; i < n; ++i) if (arr[i] != arr[i - 1] + d) return arr[i - 1] + d;
+        return arr[0];
+    }
+};
+```
 
+### **Go**
+
+```go
+func missingNumber(arr []int) int {
+	n := len(arr)
+	d := (arr[n-1] - arr[0]) / n
+	for i := 1; i < n; i++ {
+		if arr[i] != arr[i-1]+d {
+			return arr[i-1] + d
+		}
+	}
+	return arr[0]
+}
 ```
 
 ### **...**

solution/1200-1299/1228.Missing Number In Arithmetic Progression/README_EN.md

@@ -42,13 +42,60 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def missingNumber(self, arr: List[int]) -> int:
+        n = len(arr)
+        d = (arr[-1] - arr[0]) // n
+        for i in range(1, n):
+            if arr[i] != arr[i - 1] + d:
+                return arr[i - 1] + d
+        return arr[0]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int missingNumber(int[] arr) {
+        int n = arr.length;
+        int d = (arr[n - 1] - arr[0]) / n;
+        for (int i = 1; i < n; ++i) {
+            if (arr[i] != arr[i - 1] + d) {
+                return arr[i - 1] + d;
+            }
+        }
+        return arr[0];
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int missingNumber(vector<int>& arr) {
+        int n = arr.size();
+        int d = (arr[n - 1] - arr[0]) / n;
+        for (int i = 1; i < n; ++i) if (arr[i] != arr[i - 1] + d) return arr[i - 1] + d;
+        return arr[0];
+    }
+};
+```
 
+### **Go**
+
+```go
+func missingNumber(arr []int) int {
+	n := len(arr)
+	d := (arr[n-1] - arr[0]) / n
+	for i := 1; i < n; i++ {
+		if arr[i] != arr[i-1]+d {
+			return arr[i-1] + d
+		}
+	}
+	return arr[0]
+}
 ```
 
 ### **...**

solution/1200-1299/1228.Missing Number In Arithmetic Progression/Solution.cpp

@@ -0,0 +1,9 @@
+class Solution {
+public:
+    int missingNumber(vector<int>& arr) {
+        int n = arr.size();
+        int d = (arr[n - 1] - arr[0]) / n;
+        for (int i = 1; i < n; ++i) if (arr[i] != arr[i - 1] + d) return arr[i - 1] + d;
+        return arr[0];
+    }
+};

solution/1200-1299/1228.Missing Number In Arithmetic Progression/Solution.go

@@ -0,0 +1,10 @@
+func missingNumber(arr []int) int {
+	n := len(arr)
+	d := (arr[n-1] - arr[0]) / n
+	for i := 1; i < n; i++ {
+		if arr[i] != arr[i-1]+d {
+			return arr[i-1] + d
+		}
+	}
+	return arr[0]
+}

solution/1200-1299/1228.Missing Number In Arithmetic Progression/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int missingNumber(int[] arr) {
+        int n = arr.length;
+        int d = (arr[n - 1] - arr[0]) / n;
+        for (int i = 1; i < n; ++i) {
+            if (arr[i] != arr[i - 1] + d) {
+                return arr[i - 1] + d;
+            }
+        }
+        return arr[0];
+    }
+}

solution/1200-1299/1228.Missing Number In Arithmetic Progression/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def missingNumber(self, arr: List[int]) -> int:
+        n = len(arr)
+        d = (arr[-1] - arr[0]) // n
+        for i in range(1, n):
+            if arr[i] != arr[i - 1] + d:
+                return arr[i - 1] + d
+        return arr[0]

solution/1900-1999/1958.Check if Move is Legal/README.md

@@ -52,8 +52,6 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-**方法一：动态规划**
-
 <!-- tabs:start -->
 
 ### **Python3**