算法学习(第二周)

两数相加

给你两个 非空 的链表，表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的，并且每个节点只能存储 一位 数字。
请你将两个数相加，并以相同形式返回一个表示和的链表。你可以假设除了数字 0 之外，这两个数都不会以 0 开头。

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode head = new ListNode((l1.val + l2.val)%10);
        ListNode result = head;
        int tmp = (l1.val + l2.val) /10;
        l1 = l1.next;
        l2 = l2.next;
        
        while(l1 != null || l2 !=null || tmp!=0){
            if(l1 != null && l2 != null){
                ListNode next = new ListNode();
                next.val = (l1.val + l2.val + tmp)%10;
                tmp = (l1.val + l2.val + tmp)/10;
                result.next = next;
                result = result.next;

                l1 = l1.next;
                l2 = l2.next;
            }else if(l1 != null){
                ListNode next = new ListNode();
                next.val =(l1.val + tmp)%10;
                tmp = (l1.val + tmp)/10;
                result.next = next;
                result = result.next;

                l1 = l1.next;
            }else if(l2 != null){
                ListNode next = new ListNode();
                next.val =(l2.val + tmp)%10;
                tmp = (l2.val + tmp)/10;
                result.next = next;
                result = result.next;

                l2 = l2.next;
            }else if(tmp != 0){
                ListNode next = new ListNode();
                next.val =tmp;
                tmp = 0;
                result.next = next;
                result = result.next;
            }
        }

        return head;
    }
}

反转链表

反转一个单链表。

class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode pre = null;
        ListNode l1 = null;

        while(head != null){
            l1 = head;
            head = head.next;
            l1.next = pre;
            pre = l1;
        }

        return pre;
    }
}