917 added

Author: aQuaYi

.vscode/settings.json

@@ -1,7 +1,10 @@
 {
     "todo-tree.flat": true,
     "cSpell.words": [
+        "ASCI",
+        "Icode",
         "Puerkito",
+        "Qedo",
         "Subarrays",
         "boustrophedonically",
         "chromedp",
@@ -14,6 +17,7 @@
         "leetcode",
         "mozillazg",
         "nbsp",
+        "ntse",
         "pwwkew",
         "rorse",
         "stretchr",

Algorithms/0917.reverse-only-letters/README.md

@@ -1,50 +1,30 @@
 # [917. Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)
 
-<div class="content__eAC7"><div><p>Given a string <code>S</code>, return the "reversed" string where all characters that are not a letter&nbsp;stay in the same place, and all letters reverse their positions.</p>
-
-<p>&nbsp;</p>
-
-<div>
-<div>
-<div>
-<ol>
-</ol>
-</div>
-</div>
-</div>
-
-<div>
-<p><strong>Example 1:</strong></p>
-
-<pre><strong>Input: </strong><span id="example-input-1-1">"ab-cd"</span>
-<strong>Output: </strong><span id="example-output-1">"dc-ba"</span>
-</pre>
-
-<div>
-<p><strong>Example 2:</strong></p>
-
-<pre><strong>Input: </strong><span id="example-input-2-1">"a-bC-dEf-ghIj"</span>
-<strong>Output: </strong><span id="example-output-2">"j-Ih-gfE-dCba"</span>
-</pre>
-
-<div>
-<p><strong>Example 3:</strong></p>
-
-<pre><strong>Input: </strong><span id="example-input-3-1">"Test1ng-Leet=code-Q!"</span>
-<strong>Output: </strong><span id="example-output-3">"Qedo1ct-eeLg=ntse-T!"</span>
-</pre>
-
-<p>&nbsp;</p>
-
-<div>
-<p><strong><span>Note:</span></strong></p>
-
-<ol>
-	<li><code>S.length &lt;= 100</code></li>
-	<li><code>33 &lt;= S[i].ASCIIcode &lt;= 122</code>&nbsp;</li>
-	<li><code>S</code> doesn't contain <code>\</code> or <code>"</code></li>
-</ol>
-</div>
-</div>
-</div>
-</div></div></div>
+Given a string `S`, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positions.
+
+Example 1:
+
+```text
+Input: "ab-cd"
+Output: "dc-ba"
+```
+
+Example 2:
+
+```text
+Input: "a-bC-dEf-ghIj"
+Output: "j-Ih-gfE-dCba"
+```
+
+Example 3:
+
+```text
+Input: "Test1ng-Leet=code-Q!"
+Output: "Qedo1ct-eeLg=ntse-T!"
+```
+
+Note:
+
+1. `S.length <= 100`
+1. `33 <= S[i].ASCIIcode <= 122`
+1. `S` doesn't contain `\` or `"`

Algorithms/0917.reverse-only-letters/reverse-only-letters_test.go

@@ -9,11 +9,24 @@ import (
 
 // tcs is testcase slice
 var tcs = []struct {
-	S string
+	S   string
 	ans string
 }{
 
+	{
+		"ab-cd",
+		"dc-ba",
+	},
 
+	{
+		"a-bC-dEf-ghIj",
+		"j-Ih-gfE-dCba",
+	},
+
+	{
+		"Test1ng-Leet=code-Q!",
+		"Qedo1ct-eeLg=ntse-T!",
+	},
 
 	// 可以有多个 testcase
 }

leetcode.json

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 882,
-	"Updated": "2018-12-01T16:08:46.429674502+08:00",
+	"Updated": "2018-12-01T16:13:03.850957414+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 203,