标签:log code i+1 size return ret ica 排序数组 for
public class Solution { public int removeDuplicates(int[] nums) { int size=nums.length; for(int i=0;i<size-1;i++) { if(nums[i]==nums[i+1]) { for(int j=i+1;j<size-1;j++) { nums[j]=nums[j+1]; } size--; i--; } } return size; } }
标签:log code i+1 size return ret ica 排序数组 for
原文地址:http://www.cnblogs.com/ZJJ644758437/p/6517369.html