Old school JS version, not super optimized, but should be faster than, map, join, split etc
function noCarryAddition(n0, n1) { var a = n0.toString(); var b = n1.toString(); var maxLength = Math.max(a.length, b.length); var s = ''; for (var i = maxLength - 1; i >= 0; --i) { var indexA = a.length - (i + 1); var indexB = b.length - (i + 1); var valueA = (indexA >= 0)? parseInt(a[indexA]) : 0; var valueB = (indexB >= 0)? parseInt(b[indexB]) : 0; s += (valueA + valueB); } return s; }
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Old school JS version, not super optimized, but should be faster than, map, join, split etc