code.ashish.me

Atom feed

Recently added: 02 Count Of Subset Sum, 416 Partition Equal Subset Sum, 01 Subset Sum, 518 Coin Change 2, 983 Minimum Cost For Tickets

Duplicatesinsortedarray

/**
 *
 * Ashish Patel
 * e: ashishsushilPatel@gmail.com
 * w: https://ashish.me
 *
 */

class DuplicatesInSortedArray {

  static int[] func(int[] nums){
    int res = 1;
    for(int i = 1; i < nums.length; i++){
      if(nums[i] != nums[i - 1]){
        nums[res] = nums[i];
        res += 1;
      }
    }
    return nums;
  }

  public static void main(String[] args){
    int[] nums = {10, 20, 20, 30, 30, 30};
    int[] result = func(nums);
    for(int i = 0; i < result.length; i++){
      System.out.println(result[i]);
    }
  }
}

Created 2021-10-27T02:53:48+01:00 · Edit