test: [20260501] Add (396)

actions-user · actions-user · commit 85ed3127cc15 · 2026-04-30T16:27:44.000Z
diff --git a/Cargo.toml b/Cargo.toml
@@ -546,6 +546,7 @@ members = [
 	"problems/problems_2033",
 	"problems/problems_3225",
 	"problems/problems_3742",
+	"problems/problems_396",
 ]
 
 [package]
@@ -1114,3 +1115,4 @@ solution_1391 = { path = "problems/problems_1391", features = ["solution_1391"]
 solution_2033 = { path = "problems/problems_2033", features = ["solution_2033"] }
 solution_3225 = { path = "problems/problems_3225", features = ["solution_3225"] }
 solution_3742 = { path = "problems/problems_3742", features = ["solution_3742"] }
+solution_396 = { path = "problems/problems_396", features = ["solution_396"] }
diff --git a/daily-problems.json b/daily-problems.json
@@ -1,4 +1,4 @@
 {
-    "daily": "3742",
+    "daily": "396",
     "plans": ["3833", "problems", "3834", "problems", "3835", "problems", "3836", "problems"]
 }
diff --git a/golang/solution_test.go b/golang/solution_test.go
@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_3742"
+	problem "leetCode/problems/problems_396"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "3742", "problems", problem.Solve)
+	TestEach(t, "396", "problems", problem.Solve)
 }
diff --git a/problems/problems_396/Cargo.toml b/problems/problems_396/Cargo.toml
@@ -0,0 +1,21 @@
+[package]
+name = "solution_396"
+version = "0.1.0"
+edition = "2021"
+rust-version = "1.79.0"
+authors = ["benhao"]
+description = "LeetCode Solution 396 in Rust"
+readme = "../../README.md"
+
+[features]
+solution_396 = []
+
+[dependencies]
+serde_json = "1.0"
+rand = "0.8.4"
+regex = "1.10.5"
+library = { path = "../../rust/library", features = ["model"] }
+
+[lib]
+name = "solution_396"
+path = "solution.rs"
diff --git a/problems/problems_396/Solution.cpp b/problems/problems_396/Solution.cpp
@@ -0,0 +1,28 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+    int maxRotateFunction(vector<int>& nums) {
+        
+    }
+};
+
+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;
+	vector<int> nums = json::parse(inputArray.at(0));
+	return solution.maxRotateFunction(nums);
+}
diff --git a/problems/problems_396/Solution.java b/problems/problems_396/Solution.java
@@ -0,0 +1,18 @@
+package problems.problems_396;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public int maxRotateFunction(int[] nums) {
+        
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int[] nums = jsonArrayToIntArray(inputJsonValues[0]);
+        return JSON.toJSON(maxRotateFunction(nums));
+    }
+}
diff --git a/problems/problems_396/problem.md b/problems/problems_396/problem.md
@@ -0,0 +1,43 @@
+# 396. Rotate Function 
+
+<p>You are given an integer array <code>nums</code> of length <code>n</code>.</p>
+
+<p>Assume <code>arr<sub>k</sub></code> to be an array obtained by rotating <code>nums</code> by <code>k</code> positions clock-wise. We define the <strong>rotation function</strong> <code>F</code> on <code>nums</code> as follow:</p>
+
+<ul>
+	<li><code>F(k) = 0 * arr<sub>k</sub>[0] + 1 * arr<sub>k</sub>[1] + ... + (n - 1) * arr<sub>k</sub>[n - 1].</code></li>
+</ul>
+
+<p>Return <em>the maximum value of</em> <code>F(0), F(1), ..., F(n-1)</code>.</p>
+
+<p>The test cases are generated so that the answer fits in a <strong>32-bit</strong> integer.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [4,3,2,6]
+<strong>Output:</strong> 26
+<strong>Explanation:</strong>
+F(0) = (0 * 4) + (1 * 3) + (2 * 2) + (3 * 6) = 0 + 3 + 4 + 18 = 25
+F(1) = (0 * 6) + (1 * 4) + (2 * 3) + (3 * 2) = 0 + 4 + 6 + 6 = 16
+F(2) = (0 * 2) + (1 * 6) + (2 * 4) + (3 * 3) = 0 + 6 + 8 + 9 = 23
+F(3) = (0 * 3) + (1 * 2) + (2 * 6) + (3 * 4) = 0 + 2 + 12 + 12 = 26
+So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [100]
+<strong>Output:</strong> 0
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>n == nums.length</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
+</ul>
diff --git a/problems/problems_396/problem_zh.md b/problems/problems_396/problem_zh.md
@@ -0,0 +1,45 @@
+# 396. 旋转函数 
+
+<p>给定一个长度为 <code>n</code> 的整数数组&nbsp;<code>nums</code>&nbsp;。</p>
+
+<p>假设&nbsp;<code>arr<sub>k</sub></code>&nbsp;是数组&nbsp;<code>nums</code>&nbsp;顺时针旋转 <code>k</code> 个位置后的数组，我们定义&nbsp;<code>nums</code>&nbsp;的 <strong>旋转函数</strong>&nbsp;&nbsp;<code>F</code>&nbsp;为：</p>
+
+<ul>
+	<li><code>F(k) = 0 * arr<sub>k</sub>[0] + 1 * arr<sub>k</sub>[1] + ... + (n - 1) * arr<sub>k</sub>[n - 1]</code></li>
+</ul>
+
+<p>返回&nbsp;<em><code>F(0), F(1), ..., F(n-1)</code>中的最大值&nbsp;</em>。</p>
+
+<p>生成的测试用例让答案符合&nbsp;<strong>32 位</strong> 整数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre>
+<strong>输入:</strong> nums = [4,3,2,6]
+<strong>输出:</strong> 26
+<strong>解释:</strong>
+F(0) = (0 * 4) + (1 * 3) + (2 * 2) + (3 * 6) = 0 + 3 + 4 + 18 = 25
+F(1) = (0 * 6) + (1 * 4) + (2 * 3) + (3 * 2) = 0 + 4 + 6 + 6 = 16
+F(2) = (0 * 2) + (1 * 6) + (2 * 4) + (3 * 3) = 0 + 6 + 8 + 9 = 23
+F(3) = (0 * 3) + (1 * 2) + (2 * 6) + (3 * 4) = 0 + 2 + 12 + 12 = 26
+所以 F(0), F(1), F(2), F(3) 中的最大值是 F(3) = 26 。
+</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre>
+<strong>输入:</strong> nums = [100]
+<strong>输出:</strong> 0
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示:</strong></p>
+
+<ul>
+	<li><code>n == nums.length</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
+</ul>
diff --git a/problems/problems_396/solution.go b/problems/problems_396/solution.go
@@ -0,0 +1,22 @@
+package problem396
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func maxRotateFunction(nums []int) int {
+    
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var nums []int
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &nums); err != nil {
+		log.Fatal(err)
+	}
+
+	return maxRotateFunction(nums)
+}
diff --git a/problems/problems_396/solution.py b/problems/problems_396/solution.py
@@ -0,0 +1,11 @@
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.maxRotateFunction(test_input)
+
+    def maxRotateFunction(self, nums: List[int]) -> int:
+        pass
+
diff --git a/problems/problems_396/solution.rs b/problems/problems_396/solution.rs
@@ -0,0 +1,16 @@
+use serde_json::{json, Value};
+
+pub struct Solution;
+
+impl Solution {
+    pub fn max_rotate_function(nums: Vec<i32>) -> i32 {
+        
+    }
+}
+
+#[cfg(feature = "solution_396")]
+pub fn solve(input_string: String) -> Value {
+	let input_values: Vec<String> = input_string.split('\n').map(|x| x.to_string()).collect();
+	let nums: Vec<i32> = serde_json::from_str(&input_values[0]).expect("Failed to parse input");
+	json!(Solution::max_rotate_function(nums))
+}
diff --git a/problems/problems_396/solution.ts b/problems/problems_396/solution.ts
@@ -0,0 +1,9 @@
+function maxRotateFunction(nums: number[]): number {
+    
+};
+
+export function Solve(inputJsonElement: string): any {
+	const inputValues: string[] = inputJsonElement.split("\n");
+	const nums: number[] = JSON.parse(inputValues[0]);
+	return maxRotateFunction(nums);
+}
diff --git a/problems/problems_396/testcase b/problems/problems_396/testcase
@@ -0,0 +1,2 @@
+["[4,3,2,6]", "[100]"]
+[26, 0]
diff --git a/problems/problems_396/testcase.py b/problems/problems_396/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=[4, 3, 2, 6], Output=26))
+		self.testcases.append(case(Input=[100], Output=0))
+
+	def get_testcases(self):
+		return self.testcases
diff --git a/rust/test_executor/tests/solutions_test.rs b/rust/test_executor/tests/solutions_test.rs
@@ -1,11 +1,11 @@
-const PROBLEMS: [[&str; 2]; 1] = [["problems", "3742"]];
+const PROBLEMS: [[&str; 2]; 1] = [["problems", "396"]];
 
 #[cfg(test)]
 mod test {
 	use test_executor::run_test::run_test;
 	use crate::PROBLEMS;
 
-	use solution_3742 as solution;
+	use solution_396 as solution;
 
 	#[test]
 	fn test_solutions() {

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`	`1`	`{`
`2`		`- "daily": "3742",`
	`2`	`+ "daily": "396",`
`3`	`3`	`"plans": ["3833", "problems", "3834", "problems", "3835", "problems", "3836", "problems"]`
`4`	`4`	`}`
Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,10 @@`
`1`	`1`	`package golang`
`2`	`2`
`3`	`3`	`import (`
`4`		`- problem "leetCode/problems/problems_3742"`
	`4`	`+ problem "leetCode/problems/problems_396"`
`5`	`5`	`"testing"`
`6`	`6`	`)`
`7`	`7`
`8`	`8`	`func TestSolution(t *testing.T) {`
`9`		`- TestEach(t, "3742", "problems", problem.Solve)`
	`9`	`+ TestEach(t, "396", "problems", problem.Solve)`
`10`	`10`	`}`