Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.<\/p>\n
Note:<\/p>\n
The length of both num1 and num2 is < 5100.\nBoth num1 and num2 contains only digits 0-9.\nBoth num1 and num2 does not contain any leading zero.\nYou must not use any built-in BigInteger library or convert the inputs to integer directly.\n\n\n\n
\r\n\r\n\/**\r\n * @param {string} num1\r\n * @param {string} num2\r\n * @return {string}\r\n *\/\r\nvar addStrings = function(num1, num2) {\r\n \r\n \/\/Make sure num1 is the longer string \r\n if(num1.length < num2.length){\r\n var t = num1;\r\n num1 = num2;\r\n num2 = t;\r\n }\r\n \r\n \/\/Give a leading zero to make sure num1 is longer even if num1 and num2 have same length\r\n num1 = ‘0’ + num1;\r\n num1 = num1.split("").reverse();\r\n num2 = num2.split("").reverse();\r\n \r\n console.log(num1,num2)\r\n \r\n \r\n for(var i=0;i<num1.length;i++){\r\n var n1 = parseInt(num1[i]);\r\n var n2 = parseInt((typeof num2[i] == ‘undefined’)?0:num2[i]);\r\n var t = n1 + n2;\r\n num1[i] = t % 10;\r\n if(t >= 10){\r\n num1[i+1] = parseInt(num1[i+1]) + 1;\r\n }\r\n }\r\n \r\n if(num1[num1.length-1] == 0){ num1.pop(); }\r\n num1 = num1.reverse().join(”);\r\n \r\n return num1;\r\n \r\n};\r\n\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"