该博客介绍了LeetCode第26题的解决方案，要求在原地修改已排序数组，确保每个元素只出现一次。博主最初误以为只需返回新长度，后发现需实际修改数组。通过分享解题思路，展示了如何在常数空间复杂度内完成任务。
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example,
Given input array nums = [1,1,2],
Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.
最开始我没看清楚题目，想着return新的长度就行，想着用空间换取时间，写的算法是
public int removeDuplicates(int[] nums) {
i
订阅专栏 解锁全文
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
