fix45 from CodingBat

最新推荐文章于 2024-10-16 00:00:43 发布

Hadjshell

最新推荐文章于 2024-10-16 00:00:43 发布

阅读量96

点赞数

文章标签：算法 java

本文链接：https://blog.csdn.net/qq_40942772/article/details/120426826

版权

Problem:

(This is a slightly harder version of the fix34 problem.) Return an array that contains exactly the same numbers as the given array, but rearranged so that every 4 is immediately followed by a 5. Do not move the 4's, but every other number may move. The array contains the same number of 4's and 5's, and every 4 has a number after it that is not a 4. In this version, 5's may appear anywhere in the original array.

fix45([5, 4, 9, 4, 9, 5]) → [9, 4, 5, 4, 5, 9]
fix45([1, 4, 1, 5]) → [1, 4, 5, 1]
fix45([1, 4, 1, 5, 5, 4, 1]) → [1, 4, 5, 1, 1, 4, 5]

My solution:

public int[] fix45(int[] nums) {
  // two lists store indices of unpaired 4s and 5s
  List<Integer> indicesOf4 = new ArrayList<>();
  List<Integer> indicesOf5 = new ArrayList<>();
  
  for(int i = 0; i < nums.length; i++) {
    if(nums[i] == 4 && nums[i+1] != 5)
      indicesOf4.add(i);
    if(i == 0 && nums[i] == 5 || i != 0 && nums[i] == 5 && nums[i-1] != 4)
      indicesOf5.add(i);
  }
  
  int cnt = 0;
  for(Integer i: indicesOf4) {
    nums[indicesOf5.get(cnt++)] = nums[i+1];
    nums[i+1] = 5;
  }
  return nums;
}

An excellent solution:

public int[] fix45(int[] nums) {
  int[] otherValues = new int[nums.length];

  for(int i = 0, c = 0; i < nums.length; i++)
    if(nums[i] != 4 && nums[i] != 5)
      otherValues[c++] = nums[i];

  for(int i = 0, c = 0; i < nums.length; i++)
    if(nums[i] == 4)
      nums[++i] = 5;
    else
      nums[i] = otherValues[c++];

  return nums;
}