欢迎光临
一起学习,一起进步

leetcode–优秀题目

 * 15. 3Sum

* Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0?

 * Find all unique triplets in the array which gives the sum of zero.
  Note: The solution set must not contain duplicate triplets.
  For example, given array S = [-1, 0, 1, 2, -1, -4],
     A solution set is:
     [
     [-1, 0, 1],
     [-1, -1, 2]

]

*

赞(0) 打赏
未经允许不得转载:openSL » leetcode–优秀题目

评论 抢沙发

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址

觉得文章有用就打赏一下文章作者

支付宝扫一扫打赏