2020-11-26L JS注释方式 && 1470. 重新排列数组 && 888. 公平的糖果交换

 

 

 

function shuffle(nums, n){
  let arr0 = nums.slice(0, n);
  let arr1 = nums.slice(n, 2*n);
  for(let i = 0; i < 2*n; i++){
    nums[i] = arr0[i/2];
    nums[i+1] = arr1[i/2];
    i++;
  }
  return nums;
}

let nums0 = [1,2,3,4,4,3,2,1];
let nums1 = [2,5,1,3,4,7];
let nums2 = [1,1,2,2];
let n = 4

function shuffle(nums, n){
  let arr0 = nums.splice(n);
  let arr1 = [];
  for(let i = 0; i < n; i++){
    arr1.push(nums[i]);
    arr1.push(arr0[i]);
  }
  return arr1;
}

没有自己写的效率高

 

 

function fairCandySwap(A, B){
  let a = A.reduce(function(pre, cur){
    return pre + cur;
  },0);
  let b = B.reduce(function(pre, cur){
    return pre + cur;
  },0);
  if(a > b){
    let c = (a-b)/2;
    for(let i = 0; i < A.length; i++){
      if(B.indexOf(A[i] - c) !== -1){
        let d = B.indexOf(A[i] - c);
        return [A[i], B[d]];
      }
    }
  }else{
    let c = (b-a)/2;
    for(let i = 0; i < A.length; i++){
      if(B.indexOf(A[i] + c) !== -1){
        let d = B.indexOf(A[i] + c);
        return [A[i], B[d]];
      }
    }
  }
}

let A = [1,2,5]
let B = [2,4]