删除有序数组中的重复项II

Remove Duplicates from Sorted Array II

​ 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 space for another array; you must do this by modifying the input array in-place with O(1) extra memory.

Clarification:

​ Confused why the returned value is an integer, but your answer is an array?

​ Note that the input array is passed in by reference, which means a modification to the input array will be known to the caller.

​ Internally you can think of this:

​ //nums is passed in by reference. (i.e, without making a copy)

​ int len = removeDuplicates(nums);

​ //any modification to nums in your function would be known by the caller.

​ //using the length returned by your function, it prints the first l

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值