LeetCode 27. Remove Element
来源:互联网 发布:excel数据分析函数 编辑:程序博客网 时间:2024/05/22 14:12
LeetCode 27. Remove Element
Description
Given an array and a value, remove all instances of that value in-place 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.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
class Solution { public int removeElement(int[] nums, int val) { int i = 0; for (int j = 0; j < nums.length; j++) { if (nums[j] != val) { nums[i++] = nums[j]; } } return i; }}
Complexity analysis
Time complexity : O(n). Assume the array has a total of n elements, both i and j traverse at most 2n steps.
Space complexity : O(1).
阅读全文
0 0
- [LeetCode]27.Remove Element
- LeetCode --- 27. Remove Element
- LeetCode 27.Remove Element
- [Leetcode] 27. Remove Element
- [Leetcode] 27.Remove Element
- 【leetcode】27. Remove Element
- 【leetcode】27. Remove Element
- Leetcode 27. Remove Element
- LeetCode 27. Remove Element
- 27. Remove Element LeetCode
- 【LeetCode】27. Remove Element
- leetcode 27. Remove Element
- leetcode 27. Remove Element
- [LeetCode]27. Remove Element
- LeetCode 27. Remove Element
- [leetcode] 27. Remove Element
- [leetcode] 27. Remove Element
- leetcode 27. Remove Element
- 【学习C++】Map使用
- Surf算法
- Coins
- 深入理解dubbo:dubbo分布式+拓展:把web和service不仅分开为不同的项目,还分开到两台机器上。
- Nginx的负载均衡
- LeetCode 27. Remove Element
- C语言内存管理一本道来
- 从零开始搭建AI音箱Alexa语音服务
- Java面试题,转载
- ASP.Net Core的Code Fist代码先行操作方法
- VMWare虚拟机网络配置
- 函数的调用过程,栈帧的创建和销毁
- 程序员30岁之前年薪不到40W,再不转行都晚了?
- 【NOIP2017普及组T4】跳房子-二分答案+DP单调队列优化