test: 3602, 3603, 3604, 3605 solution

py

Author: QuBenhao

daily-problems.json

@@ -1,4 +1,4 @@
 {
     "daily": "1865",
-    "plans": ["3597", "problems", "3598", "problems", "3599", "problems", "3600", "problems"]
+    "plans": ["3602", "problems", "3603", "problems", "3604", "problems", "3605", "problems"]
 }

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_1865"
+	problem "leetCode/problems/problems_3602"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "1865", "problems", problem.Solve)
+	TestEach(t, "3602", "problems", problem.Solve)
 }

problems/problems_3602/Solution.cpp

@@ -0,0 +1,28 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+    string concatHex36(int n) {
+        
+    }
+};
+
+json leetcode::qubh::Solve(string input_json_values) {
+	vector<string> inputArray;
+	size_t pos = input_json_values.find('\n');
+	while (pos != string::npos) {
+		inputArray.push_back(input_json_values.substr(0, pos));
+		input_json_values = input_json_values.substr(pos + 1);
+		pos = input_json_values.find('\n');
+	}
+	inputArray.push_back(input_json_values);
+
+	Solution solution;
+	int n = json::parse(inputArray.at(0));
+	return solution.concatHex36(n);
+}

problems/problems_3602/Solution.java

@@ -0,0 +1,18 @@
+package problems.problems_3602;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public String concatHex36(int n) {
+        
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int n = Integer.parseInt(inputJsonValues[0]);
+        return JSON.toJSON(concatHex36(n));
+    }
+}

problems/problems_3602/problem.md

@@ -0,0 +1,49 @@
+# 3602. Hexadecimal and Hexatrigesimal Conversion 
+
+<p>You are given an integer <code>n</code>.</p>
+
+<p>Return the concatenation of the <strong>hexadecimal</strong> representation of <code>n<sup>2</sup></code> and the <strong>hexatrigesimal</strong> representation of <code>n<sup>3</sup></code>.</p>
+
+<p>A <strong>hexadecimal</strong> number is defined as a base-16 numeral system that uses the digits <code>0 &ndash; 9</code> and the uppercase letters <code>A - F</code> to represent values from 0 to 15.</p>
+
+<p>A <strong>hexatrigesimal</strong> number is defined as a base-36 numeral system that uses the digits <code>0 &ndash; 9</code> and the uppercase letters <code>A - Z</code> to represent values from 0 to 35.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">n = 13</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">&quot;A91P1&quot;</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+	<li><code>n<sup>2</sup> = 13 * 13 = 169</code>. In hexadecimal, it converts to <code>(10 * 16) + 9 = 169</code>, which corresponds to <code>&quot;A9&quot;</code>.</li>
+	<li><code>n<sup>3</sup> = 13 * 13 * 13 = 2197</code>. In hexatrigesimal, it converts to <code>(1 * 36<sup>2</sup>) + (25 * 36) + 1 = 2197</code>, which corresponds to <code>&quot;1P1&quot;</code>.</li>
+	<li>Concatenating both results gives <code>&quot;A9&quot; + &quot;1P1&quot; = &quot;A91P1&quot;</code>.</li>
+</ul>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">n = 36</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">&quot;5101000&quot;</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+	<li><code>n<sup>2</sup> = 36 * 36 = 1296</code>. In hexadecimal, it converts to <code>(5 * 16<sup>2</sup>) + (1 * 16) + 0 = 1296</code>, which corresponds to <code>&quot;510&quot;</code>.</li>
+	<li><code>n<sup>3</sup> = 36 * 36 * 36 = 46656</code>. In hexatrigesimal, it converts to <code>(1 * 36<sup>3</sup>) + (0 * 36<sup>2</sup>) + (0 * 36) + 0 = 46656</code>, which corresponds to <code>&quot;1000&quot;</code>.</li>
+	<li>Concatenating both results gives <code>&quot;510&quot; + &quot;1000&quot; = &quot;5101000&quot;</code>.</li>
+</ul>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 1000</code></li>
+</ul>

problems/problems_3602/problem_zh.md

@@ -0,0 +1,51 @@
+# 3602. 十六进制和三十六进制转化 
+
+<p>给你一个整数 <code>n</code>。</p>
+
+<p>返回 <code>n<sup>2</sup></code> 的&nbsp;<strong>十六进制表示</strong> 和 <code>n<sup>3</sup></code> 的&nbsp;<strong>三十六进制表示</strong> 拼接成的字符串。</p>
+
+<p><strong>十六进制&nbsp;</strong>数定义为使用数字 <code>0 – 9</code> 和大写字母 <code>A - F</code> 表示 0 到 15 的值。</p>
+
+<p><strong>三十六进制&nbsp;</strong>数定义为使用数字 <code>0 – 9</code> 和大写字母 <code>A - Z</code> 表示 0 到 35 的值。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">n = 13</span></p>
+
+<p><strong>输出：&nbsp;</strong><span class="example-io">"A91P1"</span></p>
+
+<p><strong>解释：</strong></p>
+
+<ul>
+	<li><code>n<sup>2</sup> = 13 * 13 = 169</code>。在十六进制中，它转换为 <code>(10 * 16) + 9 = 169</code>，对应于 <code>"A9"</code>。</li>
+	<li><code>n<sup>3</sup> = 13 * 13 * 13 = 2197</code>。在三十六进制中，它转换为 <code>(1 * 36<sup>2</sup>) + (25 * 36) + 1 = 2197</code>，对应于 <code>"1P1"</code>。</li>
+	<li>连接两个结果得到 <code>"A9" + "1P1" = "A91P1"</code>。</li>
+</ul>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">n = 36</span></p>
+
+<p><strong>输出：</strong><span class="example-io">"5101000"</span></p>
+
+<p><strong>解释：</strong></p>
+
+<ul>
+	<li><code>n<sup>2</sup> = 36 * 36 = 1296</code>。在十六进制中，它转换为 <code>(5 * 16<sup>2</sup>) + (1 * 16) + 0 = 1296</code>，对应于 <code>"510"</code>。</li>
+	<li><code>n<sup>3</sup> = 36 * 36 * 36 = 46656</code>。在三十六进制中，它转换为 <code>(1 * 36<sup>3</sup>) + (0 * 36<sup>2</sup>) + (0 * 36) + 0 = 46656</code>，对应于 <code>"1000"</code>。</li>
+	<li>连接两个结果得到 <code>"510" + "1000" = "5101000"</code>。</li>
+</ul>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 1000</code></li>
+</ul>

problems/problems_3602/solution.go

@@ -0,0 +1,22 @@
+package problem3602
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func concatHex36(n int) string {
+    
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var n int
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &n); err != nil {
+		log.Fatal(err)
+	}
+
+	return concatHex36(n)
+}

problems/problems_3602/solution.py

@@ -0,0 +1,23 @@
+import string
+from collections import deque
+
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.concatHex36(test_input)
+
+    def concatHex36(self, n: int) -> str:
+        x, y = n ** 2, n ** 3
+        ans = deque()
+        while y:
+            ans.appendleft(S[y % 36])
+            y //= 36
+        while x:
+            ans.appendleft(S[x % 16])
+            x //= 16
+        return ''.join(ans)
+
+S = string.digits + string.ascii_uppercase

problems/problems_3602/testcase

@@ -0,0 +1,2 @@
+["13", "36"]
+["A91P1", "5101000"]

problems/problems_3602/testcase.py

@@ -0,0 +1,14 @@
+from collections import namedtuple
+import testcase
+
+case = namedtuple("Testcase", ["Input", "Output"])
+
+
+class Testcase(testcase.Testcase):
+	def __init__(self):
+		self.testcases = []
+		self.testcases.append(case(Input=13, Output="A91P1"))
+		self.testcases.append(case(Input=36, Output="5101000"))
+
+	def get_testcases(self):
+		return self.testcases