feat: add solutions to lc problem: No.2027

No.2027.Minimum Moves to Convert String

Author: yanglbme

solution/2000-2099/2027.Minimum Moves to Convert String/README.md

@@ -53,22 +53,81 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：贪心**
+
+遍历字符串 $s$，只要遇到 `X`，指针就直接往后移动三格，并且答案加 $1$；否则指针往后移动一格。
+
+时间复杂度 $O(n)$。其中 $n$ 表示字符串 $s$ 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minimumMoves(self, s: str) -> int:
+        ans = i = 0
+        while i < len(s):
+            if s[i] == "X":
+                ans += 1
+                i += 3
+            else:
+                i += 1
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minimumMoves(String s) {
+        int ans = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            if (s.charAt(i) == 'X') {
+                ++ans;
+                i += 2;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minimumMoves(string s) {
+        int ans = 0;
+        for (int i = 0; i < s.size(); ++i) {
+            if (s[i] == 'X') {
+                ++ans;
+                i += 2;
+            }
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minimumMoves(s string) int {
+	ans := 0
+	for i := 0; i < len(s); i++ {
+		if s[i] == 'X' {
+			ans++
+			i += 2
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/2000-2099/2027.Minimum Moves to Convert String/README_EN.md

@@ -52,13 +52,66 @@ Then we select the last 3 characters and convert them so that the final string c
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minimumMoves(self, s: str) -> int:
+        ans = i = 0
+        while i < len(s):
+            if s[i] == "X":
+                ans += 1
+                i += 3
+            else:
+                i += 1
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minimumMoves(String s) {
+        int ans = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            if (s.charAt(i) == 'X') {
+                ++ans;
+                i += 2;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minimumMoves(string s) {
+        int ans = 0;
+        for (int i = 0; i < s.size(); ++i) {
+            if (s[i] == 'X') {
+                ++ans;
+                i += 2;
+            }
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minimumMoves(s string) int {
+	ans := 0
+	for i := 0; i < len(s); i++ {
+		if s[i] == 'X' {
+			ans++
+			i += 2
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/2000-2099/2027.Minimum Moves to Convert String/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int minimumMoves(string s) {
+        int ans = 0;
+        for (int i = 0; i < s.size(); ++i) {
+            if (s[i] == 'X') {
+                ++ans;
+                i += 2;
+            }
+        }
+        return ans;
+    }
+};

solution/2000-2099/2027.Minimum Moves to Convert String/Solution.go

@@ -0,0 +1,10 @@
+func minimumMoves(s string) int {
+	ans := 0
+	for i := 0; i < len(s); i++ {
+		if s[i] == 'X' {
+			ans++
+			i += 2
+		}
+	}
+	return ans
+}

solution/2000-2099/2027.Minimum Moves to Convert String/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int minimumMoves(String s) {
+        int ans = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            if (s.charAt(i) == 'X') {
+                ++ans;
+                i += 2;
+            }
+        }
+        return ans;
+    }
+}

solution/2000-2099/2027.Minimum Moves to Convert String/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def minimumMoves(self, s: str) -> int:
+        ans = i = 0
+        while i < len(s):
+            if s[i] == "X":
+                ans += 1
+                i += 3
+            else:
+                i += 1
+        return ans