問題描述

var a = [1, 2, 3, 4, 5, 6, 7, 8];sum = [];array = parseInt(10 * Math.random());for (var j = 0; j < 3; j++) { for (var i = 0; i < a.length; i++) { sum[i] = a[i];if (i == array) { break}; } console.log(sum);}

問題解答

break 是可以去掉的…

let arr = [1, 2, 3, 4, 5, 6, 7, 8]let result = []for (let i = 0; i < arr.length - 1; i++) { // 每次循環重置 result result = [] for (let j = 0; j < arr.length; j++) { result.push(arr[j]) if (j >= i) break } console.log(result)}回答2：

循環的這個juli[b] 每次都不能正確的加入到數組里面

條件符合我就用break打斷

如acc獲取的下標到5，就將前1234求和 依次類推

for (var a = 0; a < cresult.length; a++) { for (var i = 1, j = 0; i < arr.length; i++, j++) {result[j] = [countDisPoToLine(cresult[a]['2'], cresult[a]['1'], arr[j]['2'], arr[j]['1'], arr[i]['2'], arr[i]['1']), arr[i]['1'], arr[i]['2'], arr[j]['1'], arr[j]['2'], arr[j]['0'], lineDis(arr[i]['1'], arr[i]['2'], arr[j]['1'], arr[j]['2'])];arrjoin[j] = result[j][0]; //循環數組中第一組關于距離的值juli[j] = result[j][6]; } //console.log(juli); mindis = Math.min.apply(Math, arrjoin); // //console.log(arrmin.length, '點距線最短距離'); console.log(mindis, '點距線最短距離');//result = []; for (var b = 0; b < result.length; b++) {///sum = lineDis(result[b][1],result[b][2],result[b][3],result[b][4]); //計算兩點之間的長度acc = isHasElementTwo(arrjoin, mindis); //查找item 在array中的下標位置 sum.push(juli[b]); //console.log(juli[b]);//console.log(sumb(acc,juli));if (b == acc) //滿足最近點下標的條件，連續相加產生連續里程。{ minxy = getPointOnPolyline(cresult[a]['2'], cresult[a]['1'], result[b][4], result[b][2], result[b][3], result[b][1]); ctt = lineDis(result[b][3], result[b][4], minxy[1], minxy[0]); console.log(minxy, '垂足坐標'); console.log(ctt, '距離最近點的距離'); break}; } //abc.push(sum ); //console.log(eval(abc.join('+'))); console.log(sum);}

**1.0374510479565615 '點距線最短距離' (index):84[736260.8899769672, 1411419.6883407037] '垂足坐標' (index):10217.38691589480421 '距離最近點的距離' (index):104[13.999781212443958, 54.4198045292843, 70.38912223496114, 10.536416088967684, 685.858750934864, 255.56736787796788, 157.4782249233069, 62.58699880968758, 646.6167989543939, 313.57803581242166, 1067.5293031990727, 958.2300622502552, 417.420483917605, 64.57688332512566, 216.4881564657956, 316.1135609002259, 81.2835112492013, 56.39033259343886, 561.7188548465188, 142.39781082935613, 893.5690953081938, 92.02929710155902, 16.993059288952495, 14.314772824074824, 14.785963614054475, 20.720394204841156, 29.40872826215661, 22.45736237849337, 19.645029625828716, 28.46256518660203, 41.71105215644795, 18.333020182101933, 16.94088291682246, 32.23066924532746, 14.250265576472243, 204.50641699722792, 20.740160172962312, 24.035660943608878, 13.999781212443958, 54.4198045292843, 70.38912223496114, 10.536416088967684, 685.858750934864, 255.56736787796788, 157.4782249233069, 62.58699880968758, 646.6167989543939, 313.57803581242166, 1067.5293031990727, 958.2300622502552, 417.420483917605, 64.57688332512566, 216.4881564657956, 316.1135609002259, 81.2835112492013, 56.39033259343886, 561.7188548465188, 142.39781082935613, 893.5690953081938, 92.02929710155902, 16.993059288952495, 14.314772824074824, 14.785963614054475, 20.720394204841156, 29.40872826215661, 22.45736237849337, 19.645029625828716, 28.46256518660203, 41.71105215644795, 18.333020182101933, 16.94088291682246, 32.23066924532746, 14.250265576472243, 204.50641699722792, 20.740160172962312, 13.999781212443958, 54.4198045292843, 70.38912223496114, 10.536416088967684, 685.858750934864, 255.56736787796788, 157.4782249233069, 62.58699880968758, 646.6167989543939, 313.57803581242166, 1067.5293031990727, 958.2300622502552, 417.420483917605, 64.57688332512566, 216.4881564657956, 316.1135609002259, 81.2835112492013, 56.39033259343886, 561.7188548465188, 142.39781082935613, 893.5690953081938, 92.02929710155902, 16.993059288952495, 14.314772824074824, 14.785963614054475]**