feat: add solutions to lc problems: No.0796,0171

Author: yanglbme

Diff for: solution/0100-0199/0171.Excel Sheet Column Number/README.md

@@ -1,4 +1,4 @@
-# [171. Excel表列序号](https://leetcode-cn.com/problems/excel-sheet-column-number)
+# [171. Excel 表列序号](https://leetcode-cn.com/problems/excel-sheet-column-number)
 
 [English Version](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README_EN.md)
 
@@ -40,7 +40,6 @@
 <p><strong>致谢：</strong><br>
 特别感谢&nbsp;<a href="http://leetcode.com/discuss/user/ts">@ts</a>&nbsp;添加此问题并创建所有测试用例。</p>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -80,12 +79,12 @@ class Solution {
 
 ```ts
 function titleToNumber(columnTitle: string): number {
-    let res: number = 0;
-    for (let char of columnTitle) {
-        res = res * 26 + char.charCodeAt(0) - 64;
-    }
-    return res;
-};
+  let res: number = 0;
+  for (let char of columnTitle) {
+    res = res * 26 + char.charCodeAt(0) - 64;
+  }
+  return res;
+}
 ```
 
 ### **C++**
@@ -103,6 +102,18 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func titleToNumber(columnTitle string) int {
+	res := 0
+	for _, c := range columnTitle {
+		res = res*26 + int(c-'A'+1)
+	}
+	return res
+}
+```
+
 ### **...**
 
 ```

Diff for: solution/0100-0199/0171.Excel Sheet Column Number/README_EN.md

@@ -57,7 +57,6 @@ AB -> 28
 	<li><code>columnTitle</code> is in the range <code>[&quot;A&quot;, &quot;FXSHRXW&quot;]</code>.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
@@ -91,12 +90,12 @@ class Solution {
 
 ```ts
 function titleToNumber(columnTitle: string): number {
-    let res: number = 0;
-    for (let char of columnTitle) {
-        res = res * 26 + char.charCodeAt(0) - 64;
-    }
-    return res;
-};
+  let res: number = 0;
+  for (let char of columnTitle) {
+    res = res * 26 + char.charCodeAt(0) - 64;
+  }
+  return res;
+}
 ```
 
 ### **C++**
@@ -114,6 +113,18 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func titleToNumber(columnTitle string) int {
+	res := 0
+	for _, c := range columnTitle {
+		res = res*26 + int(c-'A'+1)
+	}
+	return res
+}
+```
+
 ### **...**
 
 ```

Diff for: solution/0100-0199/0171.Excel Sheet Column Number/Solution.go

@@ -0,0 +1,7 @@
+func titleToNumber(columnTitle string) int {
+	res := 0
+	for _, c := range columnTitle {
+		res = res*26 + int(c-'A'+1)
+	}
+	return res
+}

Diff for: solution/0700-0799/0796.Rotate String/README.md

@@ -25,7 +25,6 @@
 	<li><code>A</code> 和&nbsp;<code>B</code>&nbsp;长度不超过&nbsp;<code>100</code>。</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -37,15 +36,51 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def rotateString(self, s: str, goal: str) -> bool:
+        if len(s) != len(goal):
+            return False
+        return goal in s + s
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public boolean rotateString(String s, String goal) {
+        if (s.length() != goal.length()) {
+            return false;
+        }
+        return (s + s).contains(goal);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool rotateString(string s, string goal) {
+        if (s.size() != goal.size()) {
+            return false;
+        }
+        return !!strstr((s + s).data(), goal.data());
+    }
+};
+```
+
+### **Go**
 
+```go
+func rotateString(s string, goal string) bool {
+	if len(s) != len(goal) {
+		return false
+	}
+	return strings.Contains(s+s, goal)
+}
 ```
 
 ### **...**

Diff for: solution/0700-0799/0796.Rotate String/README_EN.md

@@ -6,12 +6,8 @@
 
 <p>We are given two strings, <code>A</code> and <code>B</code>.</p>
 
-
-
 <p>A <em>shift on <code>A</code></em> consists of taking string <code>A</code> and moving the leftmost character to the rightmost position. For example, if <code>A = &#39;abcde&#39;</code>, then it will be <code>&#39;bcdea&#39;</code> after one shift on <code>A</code>. Return <code>True</code> if and only if <code>A</code> can become <code>B</code> after some number of shifts on <code>A</code>.</p>
 
-
-
 <pre>
 
 <strong>Example 1:</strong>
@@ -30,32 +26,62 @@
 
 </pre>
 
-
-
 <p><strong>Note:</strong></p>
 
-
-
 <ul>
 	<li><code>A</code> and <code>B</code> will have length at most <code>100</code>.</li>
 </ul>
 
-
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def rotateString(self, s: str, goal: str) -> bool:
+        if len(s) != len(goal):
+            return False
+        return goal in s + s
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public boolean rotateString(String s, String goal) {
+        if (s.length() != goal.length()) {
+            return false;
+        }
+        return (s + s).contains(goal);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool rotateString(string s, string goal) {
+        if (s.size() != goal.size()) {
+            return false;
+        }
+        return !!strstr((s + s).data(), goal.data());
+    }
+};
+```
+
+### **Go**
 
+```go
+func rotateString(s string, goal string) bool {
+	if len(s) != len(goal) {
+		return false
+	}
+	return strings.Contains(s+s, goal)
+}
 ```
 
 ### **...**

Diff for: solution/0700-0799/0796.Rotate String/Solution.cpp

@@ -0,0 +1,9 @@
+class Solution {
+public:
+    bool rotateString(string s, string goal) {
+        if (s.size() != goal.size()) {
+            return false;
+        }
+        return !!strstr((s + s).data(), goal.data());
+    }
+};

Diff for: solution/0700-0799/0796.Rotate String/Solution.go

@@ -0,0 +1,6 @@
+func rotateString(s string, goal string) bool {
+	if len(s) != len(goal) {
+		return false
+	}
+	return strings.Contains(s+s, goal)
+}

Diff for: solution/0700-0799/0796.Rotate String/Solution.java

@@ -0,0 +1,8 @@
+class Solution {
+    public boolean rotateString(String s, String goal) {
+        if (s.length() != goal.length()) {
+            return false;
+        }
+        return (s + s).contains(goal);
+    }
+}

Diff for: solution/0700-0799/0796.Rotate String/Solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def rotateString(self, s: str, goal: str) -> bool:
+        if len(s) != len(goal):
+            return False
+        return goal in s + s