LeetCode 27. Remove Element
原题链接在这里:https://leetcode.com/problems/remove-element/
题目:
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 in place with constant memory.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
Example:
Given input array nums = [3,2,2,3]
, val = 3
Your function should return length = 2, with the first two elements of nums being 2.
题解:
遇到不等于val的值就放到nums[count]上, 同事count++.
Time Complexity: O(nums.length).
Space: O(1).
AC Java:
1 public class Solution { 2 public int removeElement(int[] nums, int val) { 3 if(nums == null || nums.length == 0){ 4 return 0; 5 } 6 int count = 0; 7 for(int i = 0; i<nums.length; i++){ 8 if(nums[i]!= val){ 9 nums[count++] = nums[i]; 10 } 11 } 12 return count; 13 } 14 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步