/*
@Copyright:LintCode@Author: Monster__li@Problem: http://www.lintcode.com/problem/remove-duplicates-from-sorted-array@Language: Java@Datetime: 17-03-02 11:26*/public class Solution {
/** * @param A: a array of integers * @return : return an integer */ public int removeDuplicates(int[] nums) { // write your code here int i,k,length=nums.length; //显示元数组 /*System.out.println("元数组为:"); for(i=0;i<length;i++) { System.out.print(nums[i]+" "); }*/ //找到重复的数字,并将后面所有元素前移一位 for(i=0;i<length-1;i++) { if(nums[i+1]==nums[i]) { for(k=i+1;k<length-1;k++) { nums[k]=nums[k+1]; } length--; nums[k]=-1; i--; } } //A[i]=(-1); //输出处理后的数组 // System.out.println("\n处理后的数组为:"); /*for(i=0;i<length;i++) { System.out.print(nums[i]); }*/ return length; }}