feat: add solutions to lc problem: No.1859

yanglbme · yanglbme · commit 9871e52c45c7 · 2022-09-07T15:33:07.000+08:00
No.1859.Sorting the Sentence
diff --git a/solution/1800-1899/1859.Sorting the Sentence/README.md b/solution/1800-1899/1859.Sorting the Sentence/README.md
@@ -49,6 +49,14 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：字符串分割**
+
+先将字符串 `s` 按照空格分割，得到字符串数组 `words`。
+
+遍历字符串数组 `words`，提取 `words[i]` 中最后一位字符，将其转换为数字，得到 `words[i][0:len(words[i])-1]` 的实际位置。
+
+时间复杂度 $O(n)$，其中 $n$ 是字符串长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -58,12 +66,12 @@
 ```python
 class Solution:
     def sortSentence(self, s: str) -> str:
-        words = s.split(' ')
-        arr = [None] * len(words)
-        for word in words:
-            idx = int(word[-1]) - 1
-            arr[idx] = word[:-1]
-        return ' '.join(arr)
+        words = s.split()
+        ans = [None] * len(words)
+        for w in words:
+            i = int(w[-1]) - 1
+            ans[i] = w[:-1]
+        return ' '.join(ans)
 ```
 
 ### **Java**
@@ -74,13 +82,52 @@ class Solution:
 class Solution {
     public String sortSentence(String s) {
         String[] words = s.split(" ");
-        String[] arr = new String[words.length];
-        for (String word : words) {
-            int idx = word.charAt(word.length() - 1) - '0' - 1;
-            arr[idx] = word.substring(0, word.length() - 1);
+        String[] ans = new String[words.length];
+        for (String w : words) {
+            int i = w.charAt(w.length() - 1) - '1';
+            ans[i] = w.substring(0, w.length() - 1);
+        }
+        return String.join(" ", ans);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string sortSentence(string s) {
+        istringstream is(s);
+        string t;
+        vector<string> words;
+        while (is >> t) words.push_back(t);
+        vector<string> res(words.size());
+        for (auto& w : words) {
+            int i = w[w.size() - 1] - '1';
+            res[i] = w.substr(0, w.size() - 1);
+        }
+        string ans;
+        for (auto& w : res) {
+            ans += w + " ";
         }
-        return String.join(" ", arr);
+        ans.pop_back();
+        return ans;
     }
+};
+```
+
+### **Go**
+
+```go
+func sortSentence(s string) string {
+	words := strings.Split(s, " ")
+	ans := make([]string, len(words))
+	for _, w := range words {
+		i := w[len(w)-1] - '1'
+		ans[i] = w[:len(w)-1]
+	}
+	return strings.Join(ans, " ")
 }
 ```
 
@@ -92,18 +139,30 @@ class Solution {
  * @return {string}
  */
 var sortSentence = function (s) {
-    let words = s.split(' ');
-    let n = words.length;
-    let res = new Array(n);
-    for (let word of words) {
-        let key = word.slice(-1);
-        let val = word.slice(0, -1);
-        res[parseInt(key) - 1] = val;
+    const words = s.split(' ');
+    const ans = new Array(words.length);
+    for (const w of words) {
+        const i = w.charCodeAt(w.length - 1) - '1'.charCodeAt(0);
+        ans[i] = w.slice(0, w.length - 1);
     }
-    return res.join(' ');
+    return ans.join(' ');
 };
 ```
 
+### **TypeScript**
+
+```ts
+function sortSentence(s: string): string {
+    const words = s.split(' ');
+    const ans = new Array(words.length);
+    for (const w of words) {
+        const i = w.charCodeAt(w.length - 1) - '1'.charCodeAt(0);
+        ans[i] = w.slice(0, w.length - 1);
+    }
+    return ans.join(' ');
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1800-1899/1859.Sorting the Sentence/README_EN.md b/solution/1800-1899/1859.Sorting the Sentence/README_EN.md
@@ -61,12 +61,12 @@
 ```python
 class Solution:
     def sortSentence(self, s: str) -> str:
-        words = s.split(' ')
-        arr = [None] * len(words)
-        for word in words:
-            idx = int(word[-1]) - 1
-            arr[idx] = word[:-1]
-        return ' '.join(arr)
+        words = s.split()
+        ans = [None] * len(words)
+        for w in words:
+            i = int(w[-1]) - 1
+            ans[i] = w[:-1]
+        return ' '.join(ans)
 ```
 
 ### **Java**
@@ -75,16 +75,55 @@ class Solution:
 class Solution {
     public String sortSentence(String s) {
         String[] words = s.split(" ");
-        String[] arr = new String[words.length];
-        for (String word : words) {
-            int idx = word.charAt(word.length() - 1) - '0' - 1;
-            arr[idx] = word.substring(0, word.length() - 1);
+        String[] ans = new String[words.length];
+        for (String w : words) {
+            int i = w.charAt(w.length() - 1) - '1';
+            ans[i] = w.substring(0, w.length() - 1);
         }
-        return String.join(" ", arr);
+        return String.join(" ", ans);
     }
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string sortSentence(string s) {
+        istringstream is(s);
+        string t;
+        vector<string> words;
+        while (is >> t) words.push_back(t);
+        vector<string> res(words.size());
+        for (auto& w : words) {
+            int i = w[w.size() - 1] - '1';
+            res[i] = w.substr(0, w.size() - 1);
+        }
+        string ans;
+        for (auto& w : res) {
+            ans += w + " ";
+        }
+        ans.pop_back();
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func sortSentence(s string) string {
+	words := strings.Split(s, " ")
+	ans := make([]string, len(words))
+	for _, w := range words {
+		i := w[len(w)-1] - '1'
+		ans[i] = w[:len(w)-1]
+	}
+	return strings.Join(ans, " ")
+}
+```
+
 ### **JavaScript**
 
 ```js
@@ -93,18 +132,30 @@ class Solution {
  * @return {string}
  */
 var sortSentence = function (s) {
-    let words = s.split(' ');
-    let n = words.length;
-    let res = new Array(n);
-    for (let word of words) {
-        let key = word.slice(-1);
-        let val = word.slice(0, -1);
-        res[parseInt(key) - 1] = val;
+    const words = s.split(' ');
+    const ans = new Array(words.length);
+    for (const w of words) {
+        const i = w.charCodeAt(w.length - 1) - '1'.charCodeAt(0);
+        ans[i] = w.slice(0, w.length - 1);
     }
-    return res.join(' ');
+    return ans.join(' ');
 };
 ```
 
+### **TypeScript**
+
+```ts
+function sortSentence(s: string): string {
+    const words = s.split(' ');
+    const ans = new Array(words.length);
+    for (const w of words) {
+        const i = w.charCodeAt(w.length - 1) - '1'.charCodeAt(0);
+        ans[i] = w.slice(0, w.length - 1);
+    }
+    return ans.join(' ');
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1800-1899/1859.Sorting the Sentence/Solution.cpp b/solution/1800-1899/1859.Sorting the Sentence/Solution.cpp
@@ -0,0 +1,20 @@
+class Solution {
+public:
+    string sortSentence(string s) {
+        istringstream is(s);
+        string t;
+        vector<string> words;
+        while (is >> t) words.push_back(t);
+        vector<string> res(words.size());
+        for (auto& w : words) {
+            int i = w[w.size() - 1] - '1';
+            res[i] = w.substr(0, w.size() - 1);
+        }
+        string ans;
+        for (auto& w : res) {
+            ans += w + " ";
+        }
+        ans.pop_back();
+        return ans;
+    }
+};
diff --git a/solution/1800-1899/1859.Sorting the Sentence/Solution.go b/solution/1800-1899/1859.Sorting the Sentence/Solution.go
@@ -0,0 +1,9 @@
+func sortSentence(s string) string {
+	words := strings.Split(s, " ")
+	ans := make([]string, len(words))
+	for _, w := range words {
+		i := w[len(w)-1] - '1'
+		ans[i] = w[:len(w)-1]
+	}
+	return strings.Join(ans, " ")
+}
diff --git a/solution/1800-1899/1859.Sorting the Sentence/Solution.java b/solution/1800-1899/1859.Sorting the Sentence/Solution.java
@@ -1,11 +1,11 @@
 class Solution {
     public String sortSentence(String s) {
         String[] words = s.split(" ");
-        String[] arr = new String[words.length];
-        for (String word : words) {
-            int idx = word.charAt(word.length() - 1) - '0' - 1;
-            arr[idx] = word.substring(0, word.length() - 1);
+        String[] ans = new String[words.length];
+        for (String w : words) {
+            int i = w.charAt(w.length() - 1) - '1';
+            ans[i] = w.substring(0, w.length() - 1);
         }
-        return String.join(" ", arr);
+        return String.join(" ", ans);
     }
 }
diff --git a/solution/1800-1899/1859.Sorting the Sentence/Solution.js b/solution/1800-1899/1859.Sorting the Sentence/Solution.js
@@ -3,13 +3,11 @@
  * @return {string}
  */
 var sortSentence = function (s) {
-    let words = s.split(' ');
-    let n = words.length;
-    let res = new Array(n);
-    for (let word of words) {
-        let key = word.slice(-1);
-        let val = word.slice(0, -1);
-        res[parseInt(key) - 1] = val;
+    const words = s.split(' ');
+    const ans = new Array(words.length);
+    for (const w of words) {
+        const i = w.charCodeAt(w.length - 1) - '1'.charCodeAt(0);
+        ans[i] = w.slice(0, w.length - 1);
     }
-    return res.join(' ');
+    return ans.join(' ');
 };
diff --git a/solution/1800-1899/1859.Sorting the Sentence/Solution.py b/solution/1800-1899/1859.Sorting the Sentence/Solution.py
@@ -1,8 +1,8 @@
 class Solution:
     def sortSentence(self, s: str) -> str:
-        words = s.split(' ')
-        arr = [None] * len(words)
-        for word in words:
-            idx = int(word[-1]) - 1
-            arr[idx] = word[:-1]
-        return ' '.join(arr)
+        words = s.split()
+        ans = [None] * len(words)
+        for w in words:
+            i = int(w[-1]) - 1
+            ans[i] = w[:-1]
+        return ' '.join(ans)
diff --git a/solution/1800-1899/1859.Sorting the Sentence/Solution.ts b/solution/1800-1899/1859.Sorting the Sentence/Solution.ts
@@ -0,0 +1,9 @@
+function sortSentence(s: string): string {
+    const words = s.split(' ');
+    const ans = new Array(words.length);
+    for (const w of words) {
+        const i = w.charCodeAt(w.length - 1) - '1'.charCodeAt(0);
+        ans[i] = w.slice(0, w.length - 1);
+    }
+    return ans.join(' ');
+}

Original file line number	Diff line number	Diff line change
`@@ -1,11 +1,11 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public String sortSentence(String s) {`
`3`	`3`	`String[] words = s.split(" ");`
`4`		`- String[] arr = new String[words.length];`
`5`		`- for (String word : words) {`
`6`		`- int idx = word.charAt(word.length() - 1) - '0' - 1;`
`7`		`- arr[idx] = word.substring(0, word.length() - 1);`
	`4`	`+ String[] ans = new String[words.length];`
	`5`	`+ for (String w : words) {`
	`6`	`+ int i = w.charAt(w.length() - 1) - '1';`
	`7`	`+ ans[i] = w.substring(0, w.length() - 1);`
`8`	`8`	`}`
`9`		`- return String.join(" ", arr);`
	`9`	`+ return String.join(" ", ans);`
`10`	`10`	`}`
`11`	`11`	`}`