test: 667 solution

py, c++, go, java

Author: QuBenhao

problems/problems_667/Solution.cpp

@@ -0,0 +1,39 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+  vector<int> constructArray(int n, int k) {
+    vector<int> result;
+    for (int i = 0; i < k + 1; ++i) {
+      if (i % 2 == 0) {
+        result.push_back(i / 2 + 1);
+      } else {
+        result.push_back(k - i / 2 + 1);
+      }
+    }
+    for (int i = k + 2; i <= n; ++i) {
+      result.push_back(i);
+    }
+    return result;
+  }
+};
+
+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));
+  int k = json::parse(inputArray.at(1));
+  return solution.constructArray(n, k);
+}

problems/problems_667/Solution.java

@@ -0,0 +1,30 @@
+package problems.problems_667;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public int[] constructArray(int n, int k) {
+        int[] result = new int[n];
+        for (int i = 0; i <= k; ++i) {
+            if (i % 2 == 0) {
+                result[i] = i / 2 + 1;
+            } else {
+                result[i] = k - i / 2 + 1;
+            }
+        }
+        for (int i = k + 2; i <= n; ++i) {
+            result[i-1] = i;
+        }
+        return result;
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int n = Integer.parseInt(inputJsonValues[0]);
+		int k = Integer.parseInt(inputJsonValues[1]);
+        return JSON.toJSON(constructArray(n, k));
+    }
+}

problems/problems_667/problem.md

@@ -0,0 +1,33 @@
+# 667. Beautiful Arrangement II 
+
+<p>Given two integers <code>n</code> and <code>k</code>, construct a list <code>answer</code> that contains <code>n</code> different positive integers ranging from <code>1</code> to <code>n</code> and obeys the following requirement:</p>
+
+<ul>
+	<li>Suppose this list is <code>answer =&nbsp;[a<sub>1</sub>, a<sub>2</sub>, a<sub>3</sub>, ... , a<sub>n</sub>]</code>, then the list <code>[|a<sub>1</sub> - a<sub>2</sub>|, |a<sub>2</sub> - a<sub>3</sub>|, |a<sub>3</sub> - a<sub>4</sub>|, ... , |a<sub>n-1</sub> - a<sub>n</sub>|]</code> has exactly <code>k</code> distinct integers.</li>
+</ul>
+
+<p>Return <em>the list</em> <code>answer</code>. If there multiple valid answers, return <strong>any of them</strong>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 3, k = 1
+<strong>Output:</strong> [1,2,3]
+Explanation: The [1,2,3] has three different positive integers ranging from 1 to 3, and the [1,1] has exactly 1 distinct integer: 1
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 3, k = 2
+<strong>Output:</strong> [1,3,2]
+Explanation: The [1,3,2] has three different positive integers ranging from 1 to 3, and the [2,1] has exactly 2 distinct integers: 1 and 2.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= k &lt; n &lt;= 10<sup>4</sup></code></li>
+</ul>

problems/problems_667/problem_zh.md

@@ -0,0 +1,37 @@
+# 667. 优美的排列 II 
+
+<p>给你两个整数 <code>n</code> 和 <code>k</code> ，请你构造一个答案列表 <code>answer</code> ，该列表应当包含从 <code>1</code> 到 <code>n</code> 的 <code>n</code> 个不同正整数，并同时满足下述条件：</p>
+
+<ul>
+	<li>假设该列表是 <code>answer = [a<sub>1</sub>, a<sub>2</sub>, a<sub>3</sub>, ... , a<sub>n</sub>]</code> ，那么列表 <code>[|a<sub>1</sub> - a<sub>2</sub>|, |a<sub>2</sub> - a<sub>3</sub>|, |a<sub>3</sub> - a<sub>4</sub>|, ... , |a<sub>n-1</sub> - a<sub>n</sub>|]</code> 中应该有且仅有 <code>k</code> 个不同整数。</li>
+</ul>
+
+<p>返回列表 <code>answer</code> 。如果存在多种答案，只需返回其中 <strong>任意一种</strong> 。</p>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>n = 3, k = 1
+<strong>输出：</strong>[1, 2, 3]
+<strong>解释：</strong>[1, 2, 3] 包含 3 个范围在 1-3 的不同整数，并且 [1, 1] 中有且仅有 1 个不同整数：1
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>n = 3, k = 2
+<strong>输出：</strong>[1, 3, 2]
+<strong>解释：</strong>[1, 3, 2] 包含 3 个范围在 1-3 的不同整数，并且 [2, 1] 中有且仅有 2 个不同整数：1 和 2
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 <= k < n <= 10<sup>4</sup></code></li>
+</ul>
+
+<p> </p>

problems/problems_667/solution.go

@@ -0,0 +1,36 @@
+package problem667
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func constructArray(n int, k int) (ans []int) {
+	for i := range k + 1 {
+		if i%2 == 0 {
+			ans = append(ans, i/2+1)
+		} else {
+			ans = append(ans, k-i/2+1)
+		}
+	}
+	for i := k + 2; i <= n; i++ {
+		ans = append(ans, i)
+	}
+	return
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var n int
+	var k int
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &n); err != nil {
+		log.Fatal(err)
+	}
+	if err := json.Unmarshal([]byte(inputValues[1]), &k); err != nil {
+		log.Fatal(err)
+	}
+
+	return constructArray(n, k)
+}

problems/problems_667/solution.py

@@ -0,0 +1,18 @@
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.constructArray(*test_input)
+
+    def constructArray(self, n: int, k: int) -> List[int]:
+        ans = []
+        for i in range(k + 1):
+            if i % 2 == 0:
+                ans.append(i // 2 + 1)
+            else:
+                ans.append(k - i // 2 + 1)
+        for i in range(k + 2, n + 1):
+            ans.append(i)
+        return ans

problems/problems_667/testcase

@@ -0,0 +1,2 @@
+["3\n1", "3\n2"]
+[[1, 2, 3], [1, 3, 2]]

problems/problems_667/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=[3, 1], Output=[1, 2, 3]))
+		self.testcases.append(case(Input=[3, 2], Output=[1, 3, 2]))
+
+	def get_testcases(self):
+		return self.testcases

problems/problems_788/Solution.cpp

@@ -1,4 +1,4 @@
-// go:build ignore
+//go:build ignore
 #include "cpp/common/Solution.h"
 
 using namespace std;