[LeetCode/릿코드] 27. Remove Element

문제

 

 

반응형

---

풀이

 

 

 

class Solution {
    public int removeElement(int[] nums, int val) {
       if(nums.length == 0){
           return 0;
       }
 
        int i = 0;
        int j = nums.length-1;
       while(i<j){
           if(nums[i] == val) {
               nums[i] = nums[j];
               j--;
           }else{
               i++;
           }
       }
       if(nums[i] == val) {
           return i;
       }
       return i+1;
    }
}

---