LeetCode & linked list bug
LeetCode & linked list bug
add-two-numbers

shit test
/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
/**
 * @param {ListNode} l1
 * @param {ListNode} l2
 * @return {ListNode}
 */
var addTwoNumbers = function(l1, l2) {
  const log = console.log;
  function ListNode(val, next) {
    this.val = 0 || val;
    this.next = null || next;
  }
  log(`l1`, l1)
  log(`l2`, l2)
  const arr1 = [];
  const arr2 = [];
  while(l1) {
    arr1.push(l1.val);
    l1 = l1.next;
  }
  while(l2) {
    arr2.push(l2.val)
    l2 = l2.next;
  }
  const sum = parseInt(arr1.reverse().join(``)) + parseInt(arr2.reverse().join(``));
  // 807
  const arr = Array.from(sum + ``).reverse().map(i => parseInt(i));
  // [7, 0, 8]
  const LinkedList = (value) => {
    const node = new ListNode(value, ``);
    if(!head) {
      head = node;
    } else {
      let current = head;
      while(current.next) {
        current = current.next;
      }
      current.next = node;
    }
  };
  let head = null;
  for (let i = 0; i < arr.length; i++) {
    LinkedList(arr[i]);
  }
  log(`head`, head)
  return head;
  // return arr;
};
/* 
好垃圾的测试呀,为什么参数给的不是 ListNode, 而是 array!
答案没有毛病呀
l1 [2,4,3]
l2 [5,6,4]
head ListNode {
  val: 7,
  next: ListNode { val: 0, next: ListNode { val: 8, next: '' } }
}
 */
refs
https://leetcode.com/problems/add-two-numbers/
https://leetcode-cn.com/problems/add-two-numbers/submissions/
https://leetcode-cn.com/submissions/detail/99618022/
xgqfrms 2012-2020
www.cnblogs.com 发布文章使用:只允许注册用户才可以访问!
LeetCode & linked list bug的更多相关文章
- LeetCode Linked List Cycle II 和I 通用算法和优化算法
		Linked List Cycle II Given a linked list, return the node where the cycle begins. If there is no cyc ... 
- LeetCode 全解(bug free 训练)
		1.Two Sum Given an array of integers, return indices of the two numbers such that they add up to a s ... 
- [LeetCode] Linked List Random Node 链表随机节点
		Given a singly linked list, return a random node's value from the linked list. Each node must have t ... 
- [LeetCode] Linked List Cycle II 单链表中的环之二
		Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ... 
- [LeetCode] Linked List Cycle 单链表中的环
		Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using ex ... 
- [LeetCode]Linked List Cycle II解法学习
		问题描述如下: Given a linked list, return the node where the cycle begins. If there is no cycle, return nu ... 
- LeetCode——Linked List Cycle
		Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using ex ... 
- LeetCode——Linked List Cycle II
		Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ... 
- [LeetCode] Linked List Components 链表组件
		We are given head, the head node of a linked list containing unique integer values. We are also give ... 
随机推荐
- status 404 reading EduClient#getCourseInfoOrder(String)解决过程
			UcenterClient#getUserInfoOrder(String) failed and no fallback available.解决过程 报错内容: com.netflix.hystr ... 
- 配置完xadmin源码包后启动报错“ Apps aren't loaded yet.”
			raise AppRegistryNotReady("Apps aren't loaded yet.") django.core.exceptions. 碰到这种情况就要查看下是否 ... 
- .net core Wpf中使用cefsharp加载本地html网页,并且cefsharp支持any cpu
			第一步,在程序包管理器安装 cefsharp.wpf 第二步 您必须在项目的第一个 < propertygroup > 中添加 < cefsharpanycpusupport > ... 
- 算法总结篇---KMP算法
			目录 写在前面 例题 剪花布条 Radio Transmission OKR-Periods of Words 似乎在梦中见过的样子 Censoring 写在前面 仅为自用,不做推广 一起来看猫片吧! ... 
- Kafka Fetch Session剖析
			1.概述 最近有同学留言在使用Kafka的过程中遇到一些问题,比如在拉取的Topic中的数据时会抛出一些异常,今天笔者就为大家来分享一下Kafka的Fetch流程. 2.内容 2.1 背景 首先,我们 ... 
- win10自带输入法突然变成了繁体
			有可能是在使用Eclipse/MyEclipse的Ctrl + Shift + F进行代码格式化的时候与输入法的热键冲突了 
- K8s 二、(1、kubeadm部署Kubernetes集群)
			准备工作 满足安装 Docker 项目所需的要求,比如 64 位的 Linux 操作系统.3.10 及以上的内核版本: x86 或者 ARM 架构均可: 机器之间网络互通,这是将来容器之间网络互通的前 ... 
- java的volatile关键字(笔记)
			Volatile修饰的成员变量在每次被线程访问时,都强迫从主内存中重读该成员变量的值.而且,当成员变量发生变化时,强迫线程将变化值回写到主内存.这样在任何时刻,两个不同的线程总是看到某个成员变量的同一 ... 
- 将一个 JavaBean 对象转化为一个  Map
			package com.loan.modules.common.util; import java.beans.BeanInfo; import java.beans.IntrospectionExc ... 
- Codeforces Round #645 (Div. 2) D. The Best Vacation  (贪心,二分)
			题意:一年有\(n\)个月,每月有\(d_{i}\)天,找出连续的\(x\)天,使得这\(x\)天的日期总和最大,任意一年都能选. 题解:首先要先贪心,得到:连续的\(x\)天的最后一天一定是某个月的 ... 
