Skip to content

Commit b2ba3be

0xcaffebabe 0xcaffebabe

authored

feat: add java solution to lc problem: No.1304 (doocs#540)

* feat: add java solution to lc problem:No.1304.Find N Unique Integers Sum up to Zero * feat: algorithm optimization

1 parent e4c6e4b commit b2ba3beCopy full SHA for b2ba3be

File tree

3 files changed

+36

-2

lines changed

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

3 files changed

+36

-2

lines changed

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

Lines changed: 12 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -57,7 +57,18 @@`
`57`	`57`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`58`	`58`
`59`	`59`	```java
`60`		`-`
	`60`	`+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;`
	`67`	`+ }`
	`68`	`+ ret[n - 1] = -preSum;`
	`69`	`+ return ret;`
	`70`	`+ }`
	`71`	`+}`
`61`	`72`	```
`62`	`73`
`63`	`74`	`### ...`

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

Lines changed: 12 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -50,7 +50,18 @@`
`50`	`50`	`### Java`
`51`	`51`
`52`	`52`	```java
`53`		`-`
	`53`	`+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;`
	`60`	`+ }`
	`61`	`+ ret[n - 1] = -preSum;`
	`62`	`+ return ret;`
	`63`	`+ }`
	`64`	`+}`
`54`	`65`	```
`55`	`66`
`56`	`67`	`### ...`

`‎solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/Solution.java‎`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+class Solution {`
	`2`	`+ 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;`
	`11`	`+ }`
	`12`	`+}`

0 commit comments

Comments

(0)