add 1271

Author: luliyucoordinate

README.md

@@ -572,4 +572,5 @@ LeetCode
 |1266|[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)|c|[c++](./src/1266-Minimum-Time-Visiting-All-Points/1266.cpp)|[python](./src/1266-Minimum-Time-Visiting-All-Points/1266.py)|[go](./src/1266-Minimum-Time-Visiting-All-Points/1266.go)|[js](./src/1266-Minimum-Time-Visiting-All-Points/1266.js)|[java](./src/1266-Minimum-Time-Visiting-All-Points/1266.java)|Easy|
 |1267|[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/)|c|[c++](./src/1267-Count-Servers-that-Communicate/1267.cpp)|[python](./src/1267-Count-Servers-that-Communicate/1267.py)|[go](./src/1267-Count-Servers-that-Communicate/1267.go)|[js](./src/1267-Count-Servers-that-Communicate/1267.js)|[java](./src/1267-Count-Servers-that-Communicate/1267.java)|Medium|
 |1268|[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)|c|[c++](./src/1268-Search-Suggestions-System/1268.cpp)|[python](./src/1268-Search-Suggestions-System/1268.py)|[go](./src/1268-Search-Suggestions-System/1268.go)|[js](./src/1268-Search-Suggestions-System/1268.js)|[java](./src/1268-Search-Suggestions-System/1268.java)|Medium|
-|1269|[Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/)|c|[c++](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.cpp)|[python](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.py)|[go](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.go)|[js](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.js)|[java](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.java)|Hard|
+|1269|[Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/)|c|[c++](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.cpp)|[python](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.py)|[go](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.go)|[js](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.js)|[java](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.java)|Hard|
+|1271|[Hexspeak](https://leetcode.com/contest/biweekly-contest-14/problems/hexspeak/)|c|[c++](./src/1271-Hexspeak/1271.cpp)|[python](./src/1271-Hexspeak/1271.py)|[go](./src/1271-Hexspeak/1271.go)|[js](./src/1271-Hexspeak/1271.js)|[java](./src/1271-Hexspeak/1271.java)|Easy|

src/1271-Hexspeak/1271.cpp

@@ -0,0 +1,20 @@
+class Solution 
+{
+public:
+    string toHexspeak(string num) 
+    {
+        stringstream dataToHex;
+        string res;
+        dataToHex << uppercase << hex << stol(num);
+        
+        char i;
+        while (dataToHex >> i)
+        {
+            if (i > '1' && i <= '9') return "ERROR";
+            if (i == '0') res += 'O';
+            else if (i == '1') res += 'I';
+            else res += i;
+        }
+        return res;
+    }
+};

src/1271-Hexspeak/1271.go

@@ -0,0 +1,18 @@
+func toHexspeak(num string) string {
+    data, _ := strconv.ParseInt(num, 10, 64)
+    dataToHex := fmt.Sprintf("%x",data)
+    res := make([]rune, 0)
+    for _, i := range dataToHex {
+        if i > '1' && i <= '9' {
+            return "ERROR"
+        }
+        if i == '0' {
+            res = append(res, 'O')
+        } else if i == '1' {
+            res = append(res, 'I')
+        } else {
+            res = append(res, unicode.ToUpper(rune(i)))
+        }
+    }
+    return string(res)
+}

src/1271-Hexspeak/1271.java

@@ -0,0 +1,13 @@
+class Solution {
+    public String toHexspeak(String num) {
+        StringBuilder res = new StringBuilder();
+        char[] data = Long.toHexString(Long.parseLong(num)).toUpperCase().toCharArray();
+        for (char i : data) {
+            if (i > '1' && i <= '9') return "ERROR";
+            if (i == '0') res.append('O');
+            else if (i == '1') res.append('I');
+            else res.append(i);
+        }
+        return res.toString();
+    }
+}

src/1271-Hexspeak/1271.js

@@ -0,0 +1,10 @@
+var toHexspeak = function(num) {
+    let data = Number(num).toString(16).toUpperCase(), res = "";
+    for (let i of data) {
+        if (i > '1' && i <= '9') return "ERROR";
+        if (i == '0') res += 'O';
+        else if (i == '1') res += 'I';
+        else res += i;
+    }
+    return res;
+};

src/1271-Hexspeak/1271.py

@@ -0,0 +1,13 @@
+class Solution:
+    def toHexspeak(self, num: str) -> str:
+        data, res = hex(int(num)).upper()[2:], ""
+        for i in range(len(data)):
+            if data[i] > '1' or data[i] <= '9':
+                return "ERROR"
+            if data[i] == '0':
+                res += 'O'
+            elif data[i] == '1':
+                res += 'I'
+            else:
+                res += data[i]
+        return res

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Number of Ways to Stay in the Same Place After Some Steps"
-ID = 1269
-url = "https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/"
-difficult = "Hard"
+name = "Hexspeak"
+ID = 1271
+url = "https://leetcode.com/contest/biweekly-contest-14/problems/hexspeak/"
+difficult = "Easy"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']