add 1165

Author: luliyucoordinate

README.md

@@ -482,4 +482,5 @@ LeetCode
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | c | [c++](./src/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.cpp) |[python](./src/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.py)|[go](./src/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.go)|[js](./src/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.js)|Easy|
 |1161|[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/) | c | [c++](./src/1161-Maximum-Level-Sum-of-a-Binary-Tree/1161.cpp) |[python](./src/1161-Maximum-Level-Sum-of-a-Binary-Tree/1161.py)|[go](./src/1161-Maximum-Level-Sum-of-a-Binary-Tree/1161.go)|[js](./src/1161-Maximum-Level-Sum-of-a-Binary-Tree/1161.js)|Medium|
 |1162|[As Far from Land as Possible](https://leetcode.com/problems/as-far-from-land-as-possible/) | c | [c++](./src/1162-As-Far-from-Land-as-Possible/1162.cpp) |[python](./src/1162-As-Far-from-Land-as-Possible/1162.py)|[go](./src/1162-As-Far-from-Land-as-Possible/1162.go)|[js](./src/1162-As-Far-from-Land-as-Possible/1162.js)|Medium|
-|1163|[Last Substring in Lexicographical Order](https://leetcode.com/problems/last-substring-in-lexicographical-order/) | c | [c++](./src/1163-Last-Substring-in-Lexicographical-Order/1163.cpp) |[python](./src/1163-Last-Substring-in-Lexicographical-Order/1163.py)|[go](./src/1163-Last-Substring-in-Lexicographical-Order/1163.go)|[js](./src/1163-Last-Substring-in-Lexicographical-Order/1163.js)|Hard|
+|1163|[Last Substring in Lexicographical Order](https://leetcode.com/problems/last-substring-in-lexicographical-order/) | c | [c++](./src/1163-Last-Substring-in-Lexicographical-Order/1163.cpp) |[python](./src/1163-Last-Substring-in-Lexicographical-Order/1163.py)|[go](./src/1163-Last-Substring-in-Lexicographical-Order/1163.go)|[js](./src/1163-Last-Substring-in-Lexicographical-Order/1163.js)|Hard|
+|1165|[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/) | c | [c++](./src/1165-Single-Row-Keyboard/1165.cpp) |[python](./src/1165-Single-Row-Keyboard/1165.py)|[go](./src/1165-Single-Row-Keyboard/1165.go)|[js](./src/1165-Single-Row-Keyboard/1165.js)|Easy|

src/1165-Single-Row-Keyboard/1165.cpp

@@ -0,0 +1,20 @@
+class Solution 
+{
+public:
+    int calculateTime(string keyboard, string word) 
+    {
+        unordered_map<char, int> d;
+        for (int i = 0; i < keyboard.size(); ++i)
+        {
+            d[keyboard[i]] = i;
+        }
+        
+        int res = 0, pre = 0;
+        for (char c : word)
+        {
+            res += abs(d[c] - pre);
+            pre = d[c];
+        }
+        return res;
+    }
+};

src/1165-Single-Row-Keyboard/1165.go

@@ -0,0 +1,17 @@
+func calculateTime(keyboard string, word string) int {
+    d := make(map[rune]int)
+    for i, c := range keyboard {
+        d[c] = i
+    }
+    
+    res, pre := 0, 0
+    for _, c := range word {
+        if d[c] > pre {
+            res += d[c] - pre
+        } else {
+            res += pre - d[c]
+        }
+        pre = d[c]
+    }
+    return res
+}

src/1165-Single-Row-Keyboard/1165.js

@@ -0,0 +1,13 @@
+var calculateTime = function(keyboard, word) {
+    var d = new Map();
+    for (var i = 0; i < keyboard.length; ++i) {
+        d.set(keyboard[i], i);
+    }
+    
+    var res = 0, pre = 0;
+    for (let c of word) {
+        res += Math.abs(d.get(c) - pre);
+        pre = d.get(c);
+    }
+    return res;
+};

src/1165-Single-Row-Keyboard/1165.py

@@ -0,0 +1,11 @@
+class Solution:
+    def calculateTime(self, keyboard: str, word: str) -> int:
+        d = dict()
+        for i, v in enumerate(keyboard):
+            d[v] = i
+        
+        res, pre = 0, 0
+        for c in word:
+            res += abs(d[c] - pre)
+            pre = d[c]
+        return res