Commit2085ce7

wb-hjk570755

committed

一个数组中连续的最大和

1 parent9e69e02 commit2085ce7Copy full SHA for 2085ce7

File tree

+24

-1

lines changed

+24

-1

lines changed

Lines changed: 24 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -5,13 +5,36 @@`
`5`	`5`	`importjava.util.List;`
`6`	`6`
`7`	`7`	`/**`
`8`		`- * Description:`
	`8`	`+ * Description:三数之和`
`9`	`9`	`* Copyright: Copyright (c) 2012`
`10`	`10`	`* Company: keruyun Technology(Beijing) Chengdu Co. Ltd.`
`11`	`11`	`*`
`12`	`12`	`* @author huangjk`
`13`	`13`	`* @version 1.0 2020/9/21`
`14`	`14`	`*/`
	`15`	`+`
	`16`	`+/**`
	`17`	`+ * 15. 三数之和`
	`18`	`+ * 给你一个包含 n 个整数的数组 nums，判断 nums 中是否存在三个元素 a，b，c ，使得 a + b + c = 0 ？请你找出所有满足条件且不重复的三元组。`
	`19`	`+`
	`20`	`+ 注意：答案中不可以包含重复的三元组。`
	`21`	`+`
	`22`	`+`
	`23`	`+`
	`24`	`+ 示例：`
	`25`	`+`
	`26`	`+ 给定数组 nums = [-1, 0, 1, 2, -1, -4]，`
	`27`	`+`
	`28`	`+ 满足要求的三元组集合为：`
	`29`	`+ [`
	`30`	`+ [-1, 0, 1],`
	`31`	`+ [-1, -1, 2]`
	`32`	`+ ]`
	`33`	`+`
	`34`	`+ 来源：力扣（LeetCode）`
	`35`	`+ 链接：https://leetcode-cn.com/problems/3sum`
	`36`	`+ 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。`
	`37`	`+ */`
`15`	`38`	`publicclassThreeSum {`
`16`	`39`	`publicList<List<Integer>>threeSum(int[]nums) {`
`17`	`40`	`List<List<Integer>>result =newArrayList<>();`

Comments

(0)