my own thought about this question


  • 0
    H

    I just want to share my thought about this question,I think this method is also good

    public class Solution {
        public int removeDuplicates(int[] nums) {
          if(nums.length==0)
                return 0;
            int count = 1;
            for (int i = 1; i < nums.length; i++) {
                if (nums[i] != nums[i - 1]){
                    nums[count]=nums[i];
                    count++;
                }
            }
            return count;
        }
    }
    

Log in to reply
 

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