本文共 796 字,大约阅读时间需要 2 分钟。
function pivoIndex(nums){ let len = nums.length; let leftSum = 0; let rightSum = 0; for(let i = 0; i < len; i++){ for(let j = 0; j < i; j++){ leftSum += nums[j]; } for(let j = i+1; j < len; j++){ rightSum += nums[j]; } if(leftSum == rightSum){ return i; } leftSum = 0; rightSum = 0; } return -1;}var nums = [1, 2, 3, 0 , 3, 2, 1]
先求和,后相减的方法更好,更优化,速度更快
/** * @param {number[]} nums * @return {number} */var pivotIndex = function(nums) { let sum = 0; nums.forEach(num => sum += num); let leftSum = 0; for(i = 0; i < nums.length; i++){ if((sum - nums[i]) - leftSum == leftSum){ return i; }else{ leftSum += nums[i]; } } return -1;};
转载地址:http://shtzi.baihongyu.com/