test: [20250706] Add (1865)

Author: actions-user

Cargo.toml

@@ -247,6 +247,7 @@ members = [
 	"problems/problems_3304",
 	"problems/problems_3307",
 	"problems/problems_1394",
+	"problems/problems_1865",
 ]
 
 [package]
@@ -516,3 +517,4 @@ solution_779 = { path = "problems/problems_779", features = ["solution_779"] }
 solution_3304 = { path = "problems/problems_3304", features = ["solution_3304"] }
 solution_3307 = { path = "problems/problems_3307", features = ["solution_3307"] }
 solution_1394 = { path = "problems/problems_1394", features = ["solution_1394"] }
+solution_1865 = { path = "problems/problems_1865", features = ["solution_1865"] }

daily-problems.json

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

golang/solution_test.go

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

problems/problems_1865/Cargo.toml

@@ -0,0 +1,21 @@
+[package]
+name = "solution_1865"
+version = "0.1.0"
+edition = "2021"
+rust-version = "1.79.0"
+authors = ["benhao"]
+description = "LeetCode Solution 1865 in Rust"
+readme = "../../README.md"
+
+[features]
+solution_1865 = []
+
+[dependencies]
+serde_json = "1.0"
+rand = "0.8.4"
+regex = "1.10.5"
+library = { path = "../../rust/library", features = ["model"] }
+
+[lib]
+name = "solution_1865"
+path = "solution.rs"

problems/problems_1865/Solution.cpp

@@ -0,0 +1,59 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+
+using namespace std;
+using json = nlohmann::json;
+
+class FindSumPairs {
+public:
+    FindSumPairs(vector<int>& nums1, vector<int>& nums2) {
+        
+    }
+    
+    void add(int index, int val) {
+        
+    }
+    
+    int count(int tot) {
+        
+    }
+};
+
+/**
+ * Your FindSumPairs object will be instantiated and called as such:
+ * FindSumPairs* obj = new FindSumPairs(nums1, nums2);
+ * obj->add(index,val);
+ * int param_2 = obj->count(tot);
+ */
+
+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);
+
+	vector<string> operators = json::parse(inputArray[0]);
+	vector<vector<json>> op_values = json::parse(inputArray[1]);
+	vector<int> nums2_array = op_values[0][1].get<vector<int>>();
+	vector<int> nums1_array = op_values[0][0].get<vector<int>>();
+	auto obj0 = make_unique<FindSumPairs>(nums1_array, nums2_array);
+	vector<json> ans = {nullptr};
+	for (size_t i = 1; i < op_values.size(); ++i) {
+		if (operators[i] == "add") {
+			obj0->add(op_values[i][0], op_values[i][1]);
+			ans.push_back(nullptr);
+			continue;
+		}
+		if (operators[i] == "count") {
+			ans.push_back(obj0->count(op_values[i][0]));
+			continue;
+		}
+		ans.push_back(nullptr);
+	}
+	return ans;
+}

problems/problems_1865/Solution.java

@@ -0,0 +1,59 @@
+package problems.problems_1865;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+class FindSumPairs {
+
+    public FindSumPairs(int[] nums1, int[] nums2) {
+        
+    }
+    
+    public void add(int index, int val) {
+        
+    }
+    
+    public int count(int tot) {
+        
+    }
+}
+
+/**
+ * Your FindSumPairs object will be instantiated and called as such:
+ * FindSumPairs obj = new FindSumPairs(nums1, nums2);
+ * obj.add(index,val);
+ * int param_2 = obj.count(tot);
+ */
+
+public class Solution extends BaseSolution {
+
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        String[] operators = jsonArrayToStringArray(inputJsonValues[0]);
+		String[][] opValues = jsonArrayToString2DArray(inputJsonValues[1]);
+		int[] nums1 = jsonArrayToIntArray(opValues[0][0]);
+		int[] nums2 = jsonArrayToIntArray(opValues[0][1]);
+		FindSumPairs obj = new FindSumPairs(nums1, nums2);
+		List<Object> ans = new ArrayList<>(operators.length);
+		ans.add(null);
+		for (int i = 1; i < operators.length; i++) {
+			if (operators[i].compareTo("add") == 0) {
+				int index = Integer.parseInt(opValues[i][0]);
+				int val = Integer.parseInt(opValues[i][1]);
+				obj.add(index, val);
+				ans.add(null);
+				continue;
+			}
+			if (operators[i].compareTo("count") == 0) {
+				int tot = Integer.parseInt(opValues[i][0]);
+				ans.add(obj.count(tot));
+				continue;
+			}
+			ans.add(null);
+		}
+        return JSON.toJSON(ans);
+    }
+}

problems/problems_1865/problem.md

@@ -1,47 +1,51 @@
 # 1865. Finding Pairs With a Certain Sum [Rating: 1680.82]
 
-You are given two integer arrays `nums1` and `nums2`. You are tasked to implement a data structure that supports queries of two types:
+<p>You are given two integer arrays <code>nums1</code> and <code>nums2</code>. You are tasked to implement a data structure that supports queries of two types:</p>
 
-1. **Add** a positive integer to an element of a given index in the array `nums2`.
-2. **Count** the number of pairs `(i, j)` such that `nums1[i] + nums2[j]`equals a given value (`0 <= i < nums1.length` and `0 <= j < nums2.length`).
+<ol>
+	<li><strong>Add</strong> a positive integer to an element of a given index in the array <code>nums2</code>.</li>
+	<li><strong>Count</strong> the number of pairs <code>(i, j)</code> such that <code>nums1[i] + nums2[j]</code> equals a given value (<code>0 &lt;= i &lt; nums1.length</code> and <code>0 &lt;= j &lt; nums2.length</code>).</li>
+</ol>
 
-Implement the `FindSumPairs` class:
+<p>Implement the <code>FindSumPairs</code> class:</p>
 
-- `FindSumPairs(int[] nums1, int[] nums2)` Initializes the `FindSumPairs` object with two integer arrays `nums1` and `nums2`.
-- `void add(int index, int val)` Adds `val` to `nums2[index]`, i.e., apply `nums2[index] += val`.
-- `int count(int tot)` Returns the number of pairs `(i, j)` such that `nums1[i] + nums2[j] == tot`.
+<ul>
+	<li><code>FindSumPairs(int[] nums1, int[] nums2)</code> Initializes the <code>FindSumPairs</code> object with two integer arrays <code>nums1</code> and <code>nums2</code>.</li>
+	<li><code>void add(int index, int val)</code> Adds <code>val</code> to <code>nums2[index]</code>, i.e., apply <code>nums2[index] += val</code>.</li>
+	<li><code>int count(int tot)</code> Returns the number of pairs <code>(i, j)</code> such that <code>nums1[i] + nums2[j] == tot</code>.</li>
+</ul>
 
- 
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
 
-**Example 1:**
-
-```
-Input
-["FindSumPairs", "count", "add", "count", "count", "add", "add", "count"]
+<pre>
+<strong>Input</strong>
+[&quot;FindSumPairs&quot;, &quot;count&quot;, &quot;add&quot;, &quot;count&quot;, &quot;count&quot;, &quot;add&quot;, &quot;add&quot;, &quot;count&quot;]
 [[[1, 1, 2, 2, 2, 3], [1, 4, 5, 2, 5, 4]], [7], [3, 2], [8], [4], [0, 1], [1, 1], [7]]
-Output
+<strong>Output</strong>
 [null, 8, null, 2, 1, null, null, 11]
 
-Explanation
+<strong>Explanation</strong>
 FindSumPairs findSumPairs = new FindSumPairs([1, 1, 2, 2, 2, 3], [1, 4, 5, 2, 5, 4]);
 findSumPairs.count(7);  // return 8; pairs (2,2), (3,2), (4,2), (2,4), (3,4), (4,4) make 2 + 5 and pairs (5,1), (5,5) make 3 + 4
-findSumPairs.add(3, 2); // now nums2 = [1,4,5,4,5,4]
+findSumPairs.add(3, 2); // now nums2 = [1,4,5,<strong><u>4</u></strong><code>,5,4</code>]
 findSumPairs.count(8);  // return 2; pairs (5,2), (5,4) make 3 + 5
 findSumPairs.count(4);  // return 1; pair (5,0) makes 3 + 1
-findSumPairs.add(0, 1); // now nums2 = [2,4,5,4,5,4]
-findSumPairs.add(1, 1); // now nums2 = [2,5,5,4,5,4]
+findSumPairs.add(0, 1); // now nums2 = [<strong><u><code>2</code></u></strong>,4,5,4<code>,5,4</code>]
+findSumPairs.add(1, 1); // now nums2 = [<code>2</code>,<strong><u>5</u></strong>,5,4<code>,5,4</code>]
 findSumPairs.count(7);  // return 11; pairs (2,1), (2,2), (2,4), (3,1), (3,2), (3,4), (4,1), (4,2), (4,4) make 2 + 5 and pairs (5,3), (5,5) make 3 + 4
-```
-
- 
-
-**Constraints:**
-
-- `1 <= nums1.length <= 1000`
-- 1 <= nums2.length <= 10<sup>5</sup>
-- 1 <= nums1[i] <= 10<sup>9</sup>
-- 1 <= nums2[i] <= 10<sup>5</sup>
-- `0 <= index < nums2.length`
-- 1 <= val <= 10<sup>5</sup>
-- 1 <= tot <= 10<sup>9</sup>
-- At most `1000` calls are made to `add` and `count` **each**.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums1.length &lt;= 1000</code></li>
+	<li><code>1 &lt;= nums2.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums1[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= nums2[i] &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= index &lt; nums2.length</code></li>
+	<li><code>1 &lt;= val &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= tot &lt;= 10<sup>9</sup></code></li>
+	<li>At most <code>1000</code> calls are made to <code>add</code> and <code>count</code> <strong>each</strong>.</li>
+</ul>

problems/problems_1865/problem_zh.md

@@ -0,0 +1,53 @@
+# 1865. 找出和为指定值的下标对 [难度分: 1680.82]
+
+<p>给你两个整数数组 <code>nums1</code> 和 <code>nums2</code> ，请你实现一个支持下述两类查询的数据结构：</p>
+
+<ol>
+	<li><strong>累加</strong> ，将一个正整数加到 <code>nums2</code> 中指定下标对应元素上。</li>
+	<li><strong>计数 </strong>，统计满足 <code>nums1[i] + nums2[j]</code> 等于指定值的下标对 <code>(i, j)</code> 数目（<code>0 <= i < nums1.length</code> 且 <code>0 <= j < nums2.length</code>）。</li>
+</ol>
+
+<p>实现 <code>FindSumPairs</code> 类：</p>
+
+<ul>
+	<li><code>FindSumPairs(int[] nums1, int[] nums2)</code> 使用整数数组 <code>nums1</code> 和 <code>nums2</code> 初始化 <code>FindSumPairs</code> 对象。</li>
+	<li><code>void add(int index, int val)</code> 将 <code>val</code> 加到 <code>nums2[index]</code> 上，即，执行 <code>nums2[index] += val</code> 。</li>
+	<li><code>int count(int tot)</code> 返回满足 <code>nums1[i] + nums2[j] == tot</code> 的下标对 <code>(i, j)</code> 数目。</li>
+</ul>
+
+<p> </p>
+
+<p><strong>示例：</strong></p>
+
+<pre>
+<strong>输入：</strong>
+["FindSumPairs", "count", "add", "count", "count", "add", "add", "count"]
+[[[1, 1, 2, 2, 2, 3], [1, 4, 5, 2, 5, 4]], [7], [3, 2], [8], [4], [0, 1], [1, 1], [7]]
+<strong>输出：</strong>
+[null, 8, null, 2, 1, null, null, 11]
+
+<strong>解释：</strong>
+FindSumPairs findSumPairs = new FindSumPairs([1, 1, 2, 2, 2, 3], [1, 4, 5, 2, 5, 4]);
+findSumPairs.count(7);  // 返回 8 ; 下标对 (2,2), (3,2), (4,2), (2,4), (3,4), (4,4) 满足 2 + 5 = 7 ，下标对 (5,1), (5,5) 满足 3 + 4 = 7
+findSumPairs.add(3, 2); // 此时 nums2 = [1,4,5,<em><strong>4</strong></em><code>,5,4</code>]
+findSumPairs.count(8);  // 返回 2 ；下标对 (5,2), (5,4) 满足 3 + 5 = 8
+findSumPairs.count(4);  // 返回 1 ；下标对 (5,0) 满足 3 + 1 = 4
+findSumPairs.add(0, 1); // 此时 nums2 = [<em><strong><code>2</code></strong></em>,4,5,4<code>,5,4</code>]
+findSumPairs.add(1, 1); // 此时 nums2 = [<code>2</code>,<em><strong>5</strong></em>,5,4<code>,5,4</code>]
+findSumPairs.count(7);  // 返回 11 ；下标对 (2,1), (2,2), (2,4), (3,1), (3,2), (3,4), (4,1), (4,2), (4,4) 满足 2 + 5 = 7 ，下标对 (5,3), (5,5) 满足 3 + 4 = 7
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 <= nums1.length <= 1000</code></li>
+	<li><code>1 <= nums2.length <= 10<sup>5</sup></code></li>
+	<li><code>1 <= nums1[i] <= 10<sup>9</sup></code></li>
+	<li><code>1 <= nums2[i] <= 10<sup>5</sup></code></li>
+	<li><code>0 <= index < nums2.length</code></li>
+	<li><code>1 <= val <= 10<sup>5</sup></code></li>
+	<li><code>1 <= tot <= 10<sup>9</sup></code></li>
+	<li>最多调用 <code>add</code> 和 <code>count</code> 函数各 <code>1000</code> 次</li>
+</ul>

problems/problems_1865/solution.go

@@ -0,0 +1,83 @@
+package problem1865
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+type FindSumPairs struct {
+    
+}
+
+
+func Constructor(nums1 []int, nums2 []int) FindSumPairs {
+    
+}
+
+
+func (this *FindSumPairs) Add(index int, val int)  {
+    
+}
+
+
+func (this *FindSumPairs) Count(tot int) int {
+    
+}
+
+
+/**
+ * Your FindSumPairs object will be instantiated and called as such:
+ * obj := Constructor(nums1, nums2);
+ * obj.Add(index,val);
+ * param_2 := obj.Count(tot);
+ */
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var operators []string
+	var opValues [][]any
+	var ans []any
+	if err := json.Unmarshal([]byte(inputValues[0]), &operators); err != nil {
+		log.Println(err)
+		return nil
+	}
+	if err := json.Unmarshal([]byte(inputValues[1]), &opValues); err != nil {
+		log.Println(err)
+		return nil
+	}
+	var nums1Arr []int
+	if v, ok := opValues[0][0].([]int); ok {
+		nums1Arr = v
+	} else {
+		for _, vi := range opValues[0][0].([]any) {
+			nums1Arr = append(nums1Arr, int(vi.(float64)))
+		}
+	}
+	var nums2Arr []int
+	if v, ok := opValues[0][1].([]int); ok {
+		nums2Arr = v
+	} else {
+		for _, vi := range opValues[0][1].([]any) {
+			nums2Arr = append(nums2Arr, int(vi.(float64)))
+		}
+	}
+	obj := Constructor(nums1Arr, nums2Arr)
+	ans = append(ans, nil)
+	for i := 1; i < len(operators); i++ {
+		var res any
+		switch operators[i] {
+		case "add", "Add":
+			res = nil
+			obj.Add(int(opValues[i][0].(float64)), int(opValues[i][1].(float64)))
+		case "count", "Count":
+			res = obj.Count(int(opValues[i][0].(float64)))
+		default:
+			res = nil
+		}
+		ans = append(ans, res)
+	}
+
+
+	return ans
+}