10h30/odin-javascript-exercises
1
0
Fork 0
mirror of https://github.com/10h30/odin-javascript-exercises.git synced 2026-07-16 13:13:19 +09:00
Code Issues Packages Projects Releases Wiki Activity

Update sumAll-solution.js

Browse Source 
Change the swapping algorithm to the standard way of swapping using array restructuring.
This commit is contained in:
cats256
2023-07-03 22:52:46 -05:00
committed by GitHub
parent 5a7cd9b162
commit 415ff48c20
1 changed files with 2 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
05_sumAll/solution/sumAll-solution.js
+2 -5
View File
@@ -1,11 +1,8 @@
const sumAll = function (min, max) { const sumAll = function (min, max) {
if (!Number.isInteger(min) || !Number.isInteger(max)) return "ERROR"; if (!Number.isInteger(min) || !Number.isInteger(max)) return "ERROR";
if (min < 0 || max < 0) return "ERROR"; if (min < 0 || max < 0) return "ERROR";
if (min > max) { if (min > max) [min, max] = [max, min];
const temp = min;
min = max;
max = temp;
}
let sum = 0; let sum = 0;
for (let i = min; i < max + 1; i++) { for (let i = min; i < max + 1; i++) {
sum += i; sum += i;