LeetCode_两数相加_java

题目描述

给你两个 非空 的链表，表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的，并且每个节点只能存储 一位 数字。

请你将两个数相加，并以相同形式返回一个表示和的链表。

你可以假设除了数字 0 之外，这两个数都不会以 0 开头。

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode resultListNode = new ListNode();
        ListNode searchListNode = resultListNode;

        int temp = 0;
       while(l1!=null||l2!=null||temp!=0){
            int val1 = 0;
            int val2 = 0;
           if(l1!=null){
               val1 = l1.val;
               l1 = l1.next;
           }
           if(l2!=null){
               val2 = l2.val;
               l2 = l2.next;
           }
           
           while (searchListNode.next!=null){
               searchListNode = searchListNode.next;
           }
           searchListNode.val = (val1+val2+temp)%10;
           temp = (val1+val2+temp)/10;
           if(l1!=null||l2!=null||temp!=0){
                ListNode tempListNode = new ListNode();
                searchListNode.next = tempListNode;
           }
     
       }
       return resultListNode;
    }
}

投机方法：
想着把链表转int计算，再int转链表输出
报错：
long都不行

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        long num1 = getNumber(l1);
        long num2 = getNumber(l2);
        long numSum = num1 + num2;

        return toListNode(numSum);
    }
      //ListNode转int
    public static long getNumber(ListNode ll) {
        String numString = "";

        while (ll.next != null) {
            numString = ll.val+numString;
            ll = ll.next;
        }
        numString = ll.val+numString;

        
        return Long.valueOf(numString);
    }

    //int转ListNode
    public static ListNode toListNode(long numSum) {
        //342->243
        //字符串分割，倒取
        String numSumString = "" + numSum;
        String[] stringList = numSumString.split("");
        int stringListLength = stringList.length;

        ListNode resultListNode = new ListNode();
        resultListNode.val = Integer.parseInt(stringList[stringListLength - 1]);

        for (int i = stringListLength - 2; i >= 0; i--) {
            ListNode tempListNode =  new ListNode();
            tempListNode.val = Integer.parseInt(stringList[i]);
            ListNode searchListNode = resultListNode;
            while (searchListNode.next != null) {
                searchListNode = searchListNode.next;
            }
            searchListNode.next = tempListNode;
        }

        return resultListNode;
    }
}