list初学



/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
       if(l1==null)return l2;
       if(l2==null)return l1;
      
       ListNode head=new ListNode(0);//初始化
       ListNode p=head;//定义list 的头
       
       int tmp=0;
       while(l1!=null||l2!=null||tmp!=0){

//逐个值加入到tmp
           if(l1!=null){
               tmp+=l1.val;
               l1=l1.next;
              
           }
            if(l2!=null) {
            tmp += l2.val;
            l2 = l2.next;
        }

将tmp值取模得每一个得到的值
           p.next=new ListNode(tmp%10);
           p=p.next;

//大于10，下个tmp=1；
           tmp=tmp/10;
       }
       return head.next;
        }
      
}