Skip to content

Commit f0b42ab

Browse files
yanglbmeyanglbme
committed
feat: add solutions to lc problems
* No.1865.Finding Pairs With a Certain Sum * No.2525.Categorize Box According to Criteria * No.2526.Find Consecutive Integers from a Data Stream * No.2527.Find Xor-Beauty of Array * No.2528.Maximize the Minimum Powered City * No.2529.Maximum Count of Positive Integer and Negative Integer * No.2530.Maximal Score After Applying K Operations * No.2531.Make Number of Distinct Characters Equal
1 parent 057a89f commit f0b42ab

File tree

26 files changed

+582
-116
lines changed

26 files changed

+582
-116
lines changed

‎solution/1800-1899/1865.Finding Pairs With a Certain Sum/README.md

+106-17
Original file line numberDiff line numberDiff line change
@@ -62,7 +62,15 @@ findSumPairs.count(7); // 返回 11 ；下标对 (2,1), (2,2), (2,4), (3,1), (3
6262

6363
<!-- 这里可写通用的实现逻辑 -->
6464

65-
“哈希表”实现。
65+
**方法一：哈希表**
66+
67+
我们可以用哈希表 `cnt` 统计数组 `nums2` 中每个数字出现的次数。
68+
69+
对于 `add` 操作，我们需要更新哈希表中 `nums2[index]` 的值，即 `cnt[nums2[index]] -= 1`，然后更新 `nums2[index] += val`，最后更新哈希表中 `nums2[index]` 的值，即 `cnt[nums2[index]] += 1`。
70+
71+
对于 `count` 操作，我们遍历数组 `nums1`，对于每个数字 `v`，我们需要统计满足 `tot - v` 的数字出现的次数，即 `cnt[tot - v]`，然后将其累加到答案中。
72+
73+
时间复杂度：对于 `add` 操作，时间复杂度为 $O(1)$，对于 `count` 操作，时间复杂度为 $O(n)$，其中 $n$ 为数组 `nums1` 的长度。空间复杂度 $O(m)$，其中 $m$ 为数组 `nums2` 的长度。
6674

6775
<!-- tabs:start -->
6876

@@ -72,19 +80,20 @@ findSumPairs.count(7); // 返回 11 ；下标对 (2,1), (2,2), (2,4), (3,1), (3
7280

7381
```python
7482
class FindSumPairs:
83+
7584
def __init__(self, nums1: List[int], nums2: List[int]):
7685
self.nums1 = nums1
7786
self.nums2 = nums2
78-
self.counter = Counter(nums2)
87+
self.cnt = Counter(nums2)
7988

8089
def add(self, index: int, val: int) -> None:
81-
old_val = self.nums2[index]
82-
self.counter[old_val] -= 1
90+
old = self.nums2[index]
91+
self.cnt[old] -= 1
92+
self.cnt[old + val] += 1
8393
self.nums2[index] += val
84-
self.counter[old_val + val] += 1
8594

8695
def count(self, tot: int) -> int:
87-
return sum([self.counter[tot - num] for num in self.nums1])
96+
return sum(self.cnt[tot - v] for v in self.nums1)
8897

8998

9099
# Your FindSumPairs object will be instantiated and called as such:
@@ -101,30 +110,29 @@ class FindSumPairs:
101110
class FindSumPairs {
102111
private int[] nums1;
103112
private int[] nums2;
104-
private Map<Integer, Integer> counter;
113+
private Map<Integer, Integer> cnt = new HashMap<>();
105114

106115
public FindSumPairs(int[] nums1, int[] nums2) {
107116
this.nums1 = nums1;
108117
this.nums2 = nums2;
109-
counter = new HashMap<>();
110-
for (int num : nums2) {
111-
counter.put(num, counter.getOrDefault(num, 0) + 1);
118+
for (int v : nums2) {
119+
cnt.put(v, cnt.getOrDefault(v, 0) + 1);
112120
}
113121
}
114122

115123
public void add(int index, int val) {
116-
int oldVal = nums2[index];
117-
counter.put(oldVal, counter.get(oldVal) - 1);
124+
int old = nums2[index];
125+
cnt.put(old, cnt.get(old) - 1);
126+
cnt.put(old + val, cnt.getOrDefault(old + val, 0) + 1);
118127
nums2[index] += val;
119-
counter.put(oldVal + val, counter.getOrDefault(oldVal + val, 0) + 1);
120128
}
121129

122130
public int count(int tot) {
123-
int res = 0;
124-
for (int num : nums1) {
125-
res += counter.getOrDefault(tot - num, 0);
131+
int ans = 0;
132+
for (int v : nums1) {
133+
ans += cnt.getOrDefault(tot - v, 0);
126134
}
127-
return res;
135+
return ans;
128136
}
129137
}
130138

@@ -136,6 +144,87 @@ class FindSumPairs {
136144
*/
137145
```
138146

147+
### **C++**
148+
149+
```cpp
150+
class FindSumPairs {
151+
public:
152+
FindSumPairs(vector<int>& nums1, vector<int>& nums2) {
153+
this->nums1 = nums1;
154+
this->nums2 = nums2;
155+
for (int& v : nums2) {
156+
++cnt[v];
157+
}
158+
}
159+
160+
void add(int index, int val) {
161+
int old = nums2[index];
162+
--cnt[old];
163+
++cnt[old + val];
164+
nums2[index] += val;
165+
}
166+
167+
int count(int tot) {
168+
int ans = 0;
169+
for (int& v : nums1) {
170+
ans += cnt[tot - v];
171+
}
172+
return ans;
173+
}
174+
175+
private:
176+
vector<int> nums1;
177+
vector<int> nums2;
178+
unordered_map<int, int> cnt;
179+
};
180+
181+
/**
182+
* Your FindSumPairs object will be instantiated and called as such:
183+
* FindSumPairs* obj = new FindSumPairs(nums1, nums2);
184+
* obj->add(index,val);
185+
* int param_2 = obj->count(tot);
186+
*/
187+
```
188+
189+
### **Go**
190+
191+
```go
192+
type FindSumPairs struct {
193+
nums1 []int
194+
nums2 []int
195+
cnt map[int]int
196+
}
197+
198+
func Constructor(nums1 []int, nums2 []int) FindSumPairs {
199+
cnt := map[int]int{}
200+
for _, v := range nums2 {
201+
cnt[v]++
202+
}
203+
return FindSumPairs{nums1, nums2, cnt}
204+
}
205+
206+
func (this *FindSumPairs) Add(index int, val int) {
207+
old := this.nums2[index]
208+
this.cnt[old]--
209+
this.cnt[old+val]++
210+
this.nums2[index] += val
211+
}
212+
213+
func (this *FindSumPairs) Count(tot int) (ans int) {
214+
for _, v := range this.nums1 {
215+
ans += this.cnt[tot-v]
216+
}
217+
return
218+
}
219+
220+
/**
221+
* Your FindSumPairs object will be instantiated and called as such:
222+
* obj := Constructor(nums1, nums2);
223+
* obj.Add(index,val);
224+
* param_2 := obj.Count(tot);
225+
*/
226+
```
227+
139228
### **...**
140229

141230
```

‎solution/1800-1899/1865.Finding Pairs With a Certain Sum/README_EN.md

+99-18
Original file line numberDiff line numberDiff line change
@@ -62,19 +62,20 @@ findSumPairs.count(7); // return 11; pairs (2,1), (2,2), (2,4), (3,1), (3,2), (
6262

6363
```python
6464
class FindSumPairs:
65+
6566
def __init__(self, nums1: List[int], nums2: List[int]):
6667
self.nums1 = nums1
6768
self.nums2 = nums2
68-
self.counter = Counter(nums2)
69+
self.cnt = Counter(nums2)
6970

7071
def add(self, index: int, val: int) -> None:
71-
old_val = self.nums2[index]
72-
self.counter[old_val] -= 1
72+
old = self.nums2[index]
73+
self.cnt[old] -= 1
74+
self.cnt[old + val] += 1
7375
self.nums2[index] += val
74-
self.counter[old_val + val] += 1
7576

7677
def count(self, tot: int) -> int:
77-
return sum([self.counter[tot - num] for num in self.nums1])
78+
return sum(self.cnt[tot - v] for v in self.nums1)
7879

7980

8081
# Your FindSumPairs object will be instantiated and called as such:
@@ -89,30 +90,29 @@ class FindSumPairs:
8990
class FindSumPairs {
9091
private int[] nums1;
9192
private int[] nums2;
92-
private Map<Integer, Integer> counter;
93+
private Map<Integer, Integer> cnt = new HashMap<>();
9394

9495
public FindSumPairs(int[] nums1, int[] nums2) {
9596
this.nums1 = nums1;
9697
this.nums2 = nums2;
97-
counter = new HashMap<>();
98-
for (int num : nums2) {
99-
counter.put(num, counter.getOrDefault(num, 0) + 1);
98+
for (int v : nums2) {
99+
cnt.put(v, cnt.getOrDefault(v, 0) + 1);
100100
}
101101
}
102-
102+
103103
public void add(int index, int val) {
104-
int oldVal = nums2[index];
105-
counter.put(oldVal, counter.get(oldVal) - 1);
104+
int old = nums2[index];
105+
cnt.put(old, cnt.get(old) - 1);
106+
cnt.put(old + val, cnt.getOrDefault(old + val, 0) + 1);
106107
nums2[index] += val;
107-
counter.put(oldVal + val, counter.getOrDefault(oldVal + val, 0) + 1);
108108
}
109-
109+
110110
public int count(int tot) {
111-
int res = 0;
112-
for (int num : nums1) {
113-
res += counter.getOrDefault(tot - num, 0);
111+
int ans = 0;
112+
for (int v : nums1) {
113+
ans += cnt.getOrDefault(tot - v, 0);
114114
}
115-
return res;
115+
return ans;
116116
}
117117
}
118118

@@ -124,6 +124,87 @@ class FindSumPairs {
124124
*/
125125
```
126126

127+
### **C++**
128+
129+
```cpp
130+
class FindSumPairs {
131+
public:
132+
FindSumPairs(vector<int>& nums1, vector<int>& nums2) {
133+
this->nums1 = nums1;
134+
this->nums2 = nums2;
135+
for (int& v : nums2) {
136+
++cnt[v];
137+
}
138+
}
139+
140+
void add(int index, int val) {
141+
int old = nums2[index];
142+
--cnt[old];
143+
++cnt[old + val];
144+
nums2[index] += val;
145+
}
146+
147+
int count(int tot) {
148+
int ans = 0;
149+
for (int& v : nums1) {
150+
ans += cnt[tot - v];
151+
}
152+
return ans;
153+
}
154+
155+
private:
156+
vector<int> nums1;
157+
vector<int> nums2;
158+
unordered_map<int, int> cnt;
159+
};
160+
161+
/**
162+
* Your FindSumPairs object will be instantiated and called as such:
163+
* FindSumPairs* obj = new FindSumPairs(nums1, nums2);
164+
* obj->add(index,val);
165+
* int param_2 = obj->count(tot);
166+
*/
167+
```
168+
169+
### **Go**
170+
171+
```go
172+
type FindSumPairs struct {
173+
nums1 []int
174+
nums2 []int
175+
cnt map[int]int
176+
}
177+
178+
func Constructor(nums1 []int, nums2 []int) FindSumPairs {
179+
cnt := map[int]int{}
180+
for _, v := range nums2 {
181+
cnt[v]++
182+
}
183+
return FindSumPairs{nums1, nums2, cnt}
184+
}
185+
186+
func (this *FindSumPairs) Add(index int, val int) {
187+
old := this.nums2[index]
188+
this.cnt[old]--
189+
this.cnt[old+val]++
190+
this.nums2[index] += val
191+
}
192+
193+
func (this *FindSumPairs) Count(tot int) (ans int) {
194+
for _, v := range this.nums1 {
195+
ans += this.cnt[tot-v]
196+
}
197+
return
198+
}
199+
200+
/**
201+
* Your FindSumPairs object will be instantiated and called as such:
202+
* obj := Constructor(nums1, nums2);
203+
* obj.Add(index,val);
204+
* param_2 := obj.Count(tot);
205+
*/
206+
```
207+
127208
### **...**
128209

129210
```

‎solution/1800-1899/1865.Finding Pairs With a Certain Sum/Solution.cpp

+37
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
class FindSumPairs {
2+
public:
3+
FindSumPairs(vector<int>& nums1, vector<int>& nums2) {
4+
this->nums1 = nums1;
5+
this->nums2 = nums2;
6+
for (int& v : nums2) {
7+
++cnt[v];
8+
}
9+
}
10+
11+
void add(int index, int val) {
12+
int old = nums2[index];
13+
--cnt[old];
14+
++cnt[old + val];
15+
nums2[index] += val;
16+
}
17+
18+
int count(int tot) {
19+
int ans = 0;
20+
for (int& v : nums1) {
21+
ans += cnt[tot - v];
22+
}
23+
return ans;
24+
}
25+
26+
private:
27+
vector<int> nums1;
28+
vector<int> nums2;
29+
unordered_map<int, int> cnt;
30+
};
31+
32+
/**
33+
* Your FindSumPairs object will be instantiated and called as such:
34+
* FindSumPairs* obj = new FindSumPairs(nums1, nums2);
35+
* obj->add(index,val);
36+
* int param_2 = obj->count(tot);
37+
*/

0 commit comments

Comments
 (0)