【LeetCode算法-26】Remove Duplicates from Sorted Array
LeetCode第26题
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 space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
Example 1:
Given 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 returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
It doesn't matter what values are set beyond the returned length.
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 modification to the input array will be known to the caller as well.
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 len elements.
for (int i = 0; i < len; i++) {
print(nums[i]);
}
翻译:
给定一个已排序的数组,删除其中重复的部分,保证每个数字只出现一次,返回一个新的数组长度。
不要申明额外的数组空间,必须保证算法复杂度为O(1)
思路:
既然不能申明额外的数组,那只能在原来的数组上做变动
变动前:[1,1,2,3,3]
变动后:[1,2,3,3,3]
前3个值[1,2,3]就是我们所需要的
代码:
class Solution { public int removeDuplicates(int[] nums) { if(nums.length == 0) return 0; int j =0; for(int i = 0;i<nums.length;i++){ if(nums[j]!=nums[i]){ j++; nums[j] = nums[i]; } } return j+1; } }
原数组遍历一遍后,将不重复的数字保存在数组的前面,j就是我们需要的数据的最大下标,那么j+1就是我们需要的长度
欢迎关注我的微信公众号:安卓圈
相关文章
- Java实现 LeetCode 746 使用最小花费爬楼梯(递推)
- Java实现 LeetCode 面试题13. 机器人的运动范围(DFS)
- Java实现 LeetCode 659 分割数组为连续子序列 (哈希)
- Java实现 LeetCode 587 安装栅栏(图算法转换成数学问题)
- Java实现 LeetCode 587 安装栅栏(图算法转换成数学问题)
- Java实现 LeetCode 519 随机翻转矩阵
- Java实现 LeetCode 284 顶端迭代器
- Java实现 LeetCode 201 数字范围按位与
- Java实现 LeetCode 101 对称二叉树
- 【LeetCode算法-53】Maximum Subarray
- 【LeetCode算法-27】Remove Element
- 【LeetCode算法-9】Palindrome Number
- leetcode算法第三题
- leetcode 算法第一题python答案
- Leetcode 1967. 作为子字符串出现在单词中的字符串数目
- [LeetCode] 647. 回文子串 ☆☆☆(最长子串、动态规划、中心扩展算法)
- 【LeetCode从零单排】No 3 Longest Substring Without Repeating Characters
- [LeetCode] Network Delay Time 网络延迟时间——最短路算法 Bellman-Ford(DP) 和 dijkstra(本质上就是BFS的迭代变种) 动态规划,要会模板!
- 【Leetcode刷题Python】 860.柠檬水找零
- 【Leetcode刷题Python】15. 三数之和
- 【14】最长公共前缀【LeetCode】
- LeetCode刷题训练 && LeetCode算法和数据结构学习(一)