摘要: Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra 阅读全文
posted @ 2018-09-03 18:41 康托漫步 阅读(123) 评论(0) 推荐(0) 编辑
摘要: Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra spa 阅读全文
posted @ 2018-09-03 15:35 康托漫步 阅读(97) 评论(0) 推荐(0) 编辑
摘要: Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the thr 阅读全文
posted @ 2018-09-03 11:44 康托漫步 阅读(80) 评论(0) 推荐(0) 编辑