Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit f6a0ebf

Browse files
committed
feat: add solutions to lc problem: No.1304.Find N Unique Integers Sum up
to Zero
1 parent b2ba3be commit f6a0ebf

File tree

6 files changed

+143
-31
lines changed

6 files changed

+143
-31
lines changed

‎solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/README.md‎

Lines changed: 52 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# [1304. 和为零的N个唯一整数](https://leetcode-cn.com/problems/find-n-unique-integers-sum-up-to-zero)
1+
# [1304. 和为零的 N 个唯一整数](https://leetcode-cn.com/problems/find-n-unique-integers-sum-up-to-zero)
22

33
[English Version](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README_EN.md)
44

@@ -37,7 +37,6 @@
3737
<li><code>1 &lt;= n &lt;= 1000</code></li>
3838
</ul>
3939

40-
4140
## 解法
4241

4342
<!-- 这里可写通用的实现逻辑 -->
@@ -49,7 +48,15 @@
4948
<!-- 这里可写当前语言的特殊实现逻辑 -->
5049

5150
```python
52-
51+
class Solution:
52+
def sumZero(self, n: int) -> List[int]:
53+
presum = 0
54+
res = []
55+
for i in range(1, n):
56+
res.append(i)
57+
presum += i
58+
res.append(-presum)
59+
return res
5360
```
5461

5562
### **Java**
@@ -58,16 +65,49 @@
5865

5966
```java
6067
class Solution {
61-
public int[] sumZero(int n) {
62-
int preSum = 0;
63-
int[] ret = new int[n];
64-
for (int i = 1; i < n; ++i) {
65-
ret[i - 1] = i;
66-
preSum += i;
68+
public int[] sumZero(int n) {
69+
int preSum = 0;
70+
int[] ret = new int[n];
71+
for (int i = 1; i < n; ++i) {
72+
ret[i - 1] = i;
73+
preSum += i;
74+
}
75+
ret[n - 1] = -preSum;
76+
return ret;
77+
}
78+
}
79+
```
80+
81+
### **C++**
82+
83+
```cpp
84+
class Solution {
85+
public:
86+
vector<int> sumZero(int n) {
87+
int presum = 0;
88+
vector<int> res;
89+
for (int i = 1; i < n; ++i) {
90+
res.push_back(i);
91+
presum += i;
92+
}
93+
res.push_back(-presum);
94+
return res;
6795
}
68-
ret[n - 1] = -preSum;
69-
return ret;
70-
}
96+
};
97+
```
98+
99+
### **Go**
100+
101+
```go
102+
func sumZero(n int) []int {
103+
presum := 0
104+
var res []int
105+
for i := 1; i < n; i++ {
106+
res = append(res, i)
107+
presum += i
108+
}
109+
res = append(res, -presum)
110+
return res
71111
}
72112
```
73113

‎solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/README_EN.md‎

Lines changed: 51 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -36,31 +36,71 @@
3636
<li><code>1 &lt;= n &lt;= 1000</code></li>
3737
</ul>
3838

39-
4039
## Solutions
4140

4241
<!-- tabs:start -->
4342

4443
### **Python3**
4544

4645
```python
47-
46+
class Solution:
47+
def sumZero(self, n: int) -> List[int]:
48+
presum = 0
49+
res = []
50+
for i in range(1, n):
51+
res.append(i)
52+
presum += i
53+
res.append(-presum)
54+
return res
4855
```
4956

5057
### **Java**
5158

5259
```java
5360
class Solution {
54-
public int[] sumZero(int n) {
55-
int preSum = 0;
56-
int[] ret = new int[n];
57-
for (int i = 1; i < n; ++i) {
58-
ret[i - 1] = i;
59-
preSum += i;
61+
public int[] sumZero(int n) {
62+
int preSum = 0;
63+
int[] ret = new int[n];
64+
for (int i = 1; i < n; ++i) {
65+
ret[i - 1] = i;
66+
preSum += i;
67+
}
68+
ret[n - 1] = -preSum;
69+
return ret;
70+
}
71+
}
72+
```
73+
74+
### **C++**
75+
76+
```cpp
77+
class Solution {
78+
public:
79+
vector<int> sumZero(int n) {
80+
int presum = 0;
81+
vector<int> res;
82+
for (int i = 1; i < n; ++i) {
83+
res.push_back(i);
84+
presum += i;
85+
}
86+
res.push_back(-presum);
87+
return res;
6088
}
61-
ret[n - 1] = -preSum;
62-
return ret;
63-
}
89+
};
90+
```
91+
92+
### **Go**
93+
94+
```go
95+
func sumZero(n int) []int {
96+
presum := 0
97+
var res []int
98+
for i := 1; i < n; i++ {
99+
res = append(res, i)
100+
presum += i
101+
}
102+
res = append(res, -presum)
103+
return res
64104
}
65105
```
66106

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
class Solution {
2+
public:
3+
vector<int> sumZero(int n) {
4+
int presum = 0;
5+
vector<int> res;
6+
for (int i = 1; i < n; ++i) {
7+
res.push_back(i);
8+
presum += i;
9+
}
10+
res.push_back(-presum);
11+
return res;
12+
}
13+
};
Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
func sumZero(n int) []int {
2+
presum := 0
3+
var res []int
4+
for i := 1; i < n; i++ {
5+
res = append(res, i)
6+
presum += i
7+
}
8+
res = append(res, -presum)
9+
return res
10+
}
Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
11
class Solution {
22
public int[] sumZero(int n) {
3-
int preSum = 0;
4-
int[] ret = new int[n];
5-
for (int i = 1; i < n; ++i) {
6-
ret[i - 1] = i;
7-
preSum += i;
8-
}
9-
ret[n - 1] = -preSum;
10-
return ret;
3+
int preSum = 0;
4+
int[] ret = new int[n];
5+
for (int i = 1; i < n; ++i) {
6+
ret[i - 1] = i;
7+
preSum += i;
8+
}
9+
ret[n - 1] = -preSum;
10+
return ret;
1111
}
1212
}
Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
class Solution:
2+
def sumZero(self, n: int) -> List[int]:
3+
presum = 0
4+
res = []
5+
for i in range(1, n):
6+
res.append(i)
7+
presum += i
8+
res.append(-presum)
9+
return res

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /