|
@@ -22,7 +22,7 @@ export default {
|
|
|
let start = -1;
|
|
|
let end = -1;
|
|
|
for (let i = 0; i < nums.length; i++) {
|
|
|
- let item = nums[i];
|
|
|
+ const item = nums[i];
|
|
|
const newArray = nums.slice(i + 1);
|
|
|
newArray.forEach((element, index) => {
|
|
|
if (item + element === target) {
|
|
@@ -39,34 +39,34 @@ export default {
|
|
|
原因:342 + 465 = 807
|
|
|
*/
|
|
|
addTwoNumbers(l1, l2) {
|
|
|
- const setArr = arr => {
|
|
|
- let newArr = [];
|
|
|
+ const setArr = (arr) => {
|
|
|
+ const newArr = [];
|
|
|
for (let i = arr.length - 1; i > -1; i--) {
|
|
|
newArr.push(arr[i]);
|
|
|
}
|
|
|
- return Number.parseInt(JSON.stringify(newArr).replace(/,|\[|\]/g, ""));
|
|
|
+ return Number.parseInt(JSON.stringify(newArr).replace(/,|\[|\]/g, ''));
|
|
|
};
|
|
|
const l1Num = setArr(l1);
|
|
|
const l2Num = setArr(l2);
|
|
|
const sun = l1Num + l2Num;
|
|
|
const arrStr = sun.toString();
|
|
|
|
|
|
- let arrNum = [];
|
|
|
+ const arrNum = [];
|
|
|
for (let i = 0; i < arrStr.length; i++) {
|
|
|
arrNum.push(Number.parseInt(arrStr[i]));
|
|
|
}
|
|
|
return arrNum;
|
|
|
},
|
|
|
test() {
|
|
|
- let node = new ListNode("head");
|
|
|
- let temp = node; //哑结点
|
|
|
- let add = 0; //是否进一
|
|
|
- let sum = 0; //新链表当前未取余的值 = 链表1值 + 链表2值 + add;
|
|
|
+ const node = new ListNode('head');
|
|
|
+ let temp = node; // 哑结点
|
|
|
+ let add = 0; // 是否进一
|
|
|
+ let sum = 0; // 新链表当前未取余的值 = 链表1值 + 链表2值 + add;
|
|
|
|
|
|
- //遍历,直到最长的都为空
|
|
|
+ // 遍历,直到最长的都为空
|
|
|
while (l1 || l2) {
|
|
|
sum = (l1 ? l1.val : 0) + (l2 ? l2.val : 0) + add;
|
|
|
- temp.next = new ListNode(sum % 10); //取余则为新链表的值
|
|
|
+ temp.next = new ListNode(sum % 10); // 取余则为新链表的值
|
|
|
temp = temp.next;
|
|
|
add = sum >= 10 ? 1 : 0;
|
|
|
l1 && (l1 = l1.next);
|
|
@@ -96,15 +96,15 @@ export default {
|
|
|
* @param {ListNode} l2
|
|
|
* @return {ListNode}
|
|
|
*/
|
|
|
- var addTwoNumbers = function(l1, l2) {
|
|
|
+ const addTwoNumbers = function (l1, l2) {
|
|
|
// 返回值
|
|
|
- let res = new ListNode("begin"),
|
|
|
- // 临时变量做中间节点
|
|
|
- temp = res,
|
|
|
- // 记录上次的计算是否需要进位 初始值为0
|
|
|
- carry = 0,
|
|
|
- // 每次计算和
|
|
|
- sum = 0;
|
|
|
+ const res = new ListNode('begin');
|
|
|
+ // 临时变量做中间节点
|
|
|
+ let temp = res;
|
|
|
+ // 记录上次的计算是否需要进位 初始值为0
|
|
|
+ let carry = 0;
|
|
|
+ // 每次计算和
|
|
|
+ let sum = 0;
|
|
|
while (l1 || l2) {
|
|
|
// 求和
|
|
|
sum = getListNodeVal(l1) + getListNodeVal(l2) + carry;
|
|
@@ -130,7 +130,7 @@ export default {
|
|
|
// 返回 res.next res.val = 'begin' 记录的是我们开始 next才是保存我们的结果
|
|
|
return res.next;
|
|
|
};
|
|
|
- }
|
|
|
- }
|
|
|
+ },
|
|
|
+ },
|
|
|
};
|
|
|
</script>
|