test: 672 solution

py, c++, go, java

Author: QuBenhao

daily-problems.json

@@ -1,4 +1,4 @@
 {
-    "daily": "3440",
+    "daily": "672",
     "plans": ["3602", "problems", "3603", "problems", "3604", "problems", "3605", "problems", "3606", "problems", "3607", "problems", "3608", "problems", "3609", "problems"]
 }

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_3440"
+	problem "leetCode/problems/problems_672"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "3440", "problems", problem.Solve)
+	TestEach(t, "672", "problems", problem.Solve)
 }

problems/problems_672/Solution.cpp

@@ -0,0 +1,34 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+  int flipLights(int n, int presses) {
+    if (presses == 0)
+      return 1;
+    if (n == 1)
+      return 2;
+    if (n == 2)
+      return presses == 1 ? 3 : 4;
+    return presses == 1 ? 4 : presses == 2 ? 7 : 8;
+  }
+};
+
+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 presses = json::parse(inputArray.at(1));
+  return solution.flipLights(n, presses);
+}

problems/problems_672/Solution.java

@@ -0,0 +1,22 @@
+package problems.problems_672;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public int flipLights(int n, int presses) {
+        if (presses == 0) return 1;
+        if (n == 1) return 2;
+        if (n == 2) return presses == 1 ? 3 : 4;
+        return presses == 1 ? 4 : presses == 2 ? 7 : 8;
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int n = Integer.parseInt(inputJsonValues[0]);
+		int presses = Integer.parseInt(inputJsonValues[1]);
+        return JSON.toJSON(flipLights(n, presses));
+    }
+}

problems/problems_672/problem.md

@@ -0,0 +1,56 @@
+# 672. Bulb Switcher II 
+
+<p>There is a room with <code>n</code> bulbs labeled from <code>1</code> to <code>n</code> that all are turned on initially, and <strong>four buttons</strong> on the wall. Each of the four buttons has a different functionality where:</p>
+
+<ul>
+	<li><strong>Button 1:</strong> Flips the status of all the bulbs.</li>
+	<li><strong>Button 2:</strong> Flips the status of all the bulbs with even labels (i.e., <code>2, 4, ...</code>).</li>
+	<li><strong>Button 3:</strong> Flips the status of all the bulbs with odd labels (i.e., <code>1, 3, ...</code>).</li>
+	<li><strong>Button 4:</strong> Flips the status of all the bulbs with a label <code>j = 3k + 1</code> where <code>k = 0, 1, 2, ...</code> (i.e., <code>1, 4, 7, 10, ...</code>).</li>
+</ul>
+
+<p>You must make <strong>exactly</strong> <code>presses</code> button presses in total. For each press, you may pick <strong>any</strong> of the four buttons to press.</p>
+
+<p>Given the two integers <code>n</code> and <code>presses</code>, return <em>the number of <strong>different possible statuses</strong> after performing all </em><code>presses</code><em> button presses</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 1, presses = 1
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> Status can be:
+- [off] by pressing button 1
+- [on] by pressing button 2
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 2, presses = 1
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> Status can be:
+- [off, off] by pressing button 1
+- [on, off] by pressing button 2
+- [off, on] by pressing button 3
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 3, presses = 1
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> Status can be:
+- [off, off, off] by pressing button 1
+- [off, on, off] by pressing button 2
+- [on, off, on] by pressing button 3
+- [off, on, on] by pressing button 4
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 1000</code></li>
+	<li><code>0 &lt;= presses &lt;= 1000</code></li>
+</ul>

problems/problems_672/problem_zh.md

@@ -0,0 +1,60 @@
+# 672. 灯泡开关 Ⅱ 
+
+<p>房间中有 <code>n</code>&nbsp;只已经打开的灯泡，编号从 <code>1</code> 到 <code>n</code> 。墙上挂着 <strong>4 个开关</strong> 。</p>
+
+<p>这 4 个开关各自都具有不同的功能，其中：</p>
+
+<ul>
+	<li><strong>开关 1 ：</strong>反转当前所有灯的状态（即开变为关，关变为开）</li>
+	<li><strong>开关 2 ：</strong>反转编号为偶数的灯的状态（即 <code>0, 2, 4, ...</code>）</li>
+	<li><strong>开关 3 ：</strong>反转编号为奇数的灯的状态（即 <code>1, 3, ...</code>）</li>
+	<li><strong>开关 4 ：</strong>反转编号为 <code>j = 3k + 1</code> 的灯的状态，其中 <code>k = 0, 1, 2, ...</code>（即 <code>1, 4, 7, 10, ...</code>）</li>
+</ul>
+
+<p>你必须 <strong>恰好</strong> 按压开关 <code>presses</code> 次。每次按压，你都需要从 4 个开关中选出一个来执行按压操作。</p>
+
+<p>给你两个整数 <code>n</code> 和 <code>presses</code> ，执行完所有按压之后，返回 <strong>不同可能状态</strong> 的数量。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>n = 1, presses = 1
+<strong>输出：</strong>2
+<strong>解释：</strong>状态可以是：
+- 按压开关 1 ，[关]
+- 按压开关 2 ，[开]
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>n = 2, presses = 1
+<strong>输出：</strong>3
+<strong>解释：</strong>状态可以是：
+- 按压开关 1 ，[关, 关]
+- 按压开关 2 ，[开, 关]
+- 按压开关 3 ，[关, 开]
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>n = 3, presses = 1
+<strong>输出：</strong>4
+<strong>解释：</strong>状态可以是：
+- 按压开关 1 ，[关, 关, 关]
+- 按压开关 2 ，[关, 开, 关]
+- 按压开关 3 ，[开, 关, 开]
+- 按压开关 4 ，[关, 开, 开]
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 1000</code></li>
+	<li><code>0 &lt;= presses &lt;= 1000</code></li>
+</ul>

problems/problems_672/solution.go

@@ -0,0 +1,44 @@
+package problem672
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func flipLights(n int, presses int) int {
+	if presses == 0 {
+		return 1
+	}
+	if n == 1 {
+		return 2
+	}
+	if n == 2 {
+		if presses == 1 {
+			return 3
+		}
+		return 4
+	}
+	if presses == 1 {
+		return 4
+	}
+	if presses == 2 {
+		return 7
+	}
+	return 8
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var n int
+	var presses int
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &n); err != nil {
+		log.Fatal(err)
+	}
+	if err := json.Unmarshal([]byte(inputValues[1]), &presses); err != nil {
+		log.Fatal(err)
+	}
+
+	return flipLights(n, presses)
+}

problems/problems_672/solution.py

@@ -0,0 +1,16 @@
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.flipLights(*test_input)
+
+    def flipLights(self, n: int, presses: int) -> int:
+        if presses == 0:
+            return 1
+        if n == 1:
+            return 2
+        if n == 2:
+            return 3 if presses == 1 else 4
+        return 4 if presses == 1 else (7 if presses == 2 else 8)

problems/problems_672/testcase

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

problems/problems_672/testcase.py

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