share my java code


  • 0
    W

    public class Solution {
    public int removeElement(int[] nums, int val) {
    int numLength=0;
    for(int i=0;i<nums.length;i++){
    if(nums[i]!=val){
    nums[numLength++]=nums[i];
    }
    }
    return numLength;
    }
    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.