算法打卡第二周

leetCode第206题添加链接描述

class Solution {
    public ListNode reverseList(ListNode head) {
         if (head == null) {
            return null;
        }
        ListNode pre = head;
        ListNode curr = head.next;
        int index = 0;
        while (curr != null) {
            ListNode next = curr.next;
            if (index == 0) {
                pre.next = null;
            }
            curr.next = pre;
            pre = curr;
            curr = next;
            index++;
        }
        return pre;
    }
}

LeetCode第2题

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
     ListNode head = new ListNode();
        ListNode addNode = head;
        ListNode l1Curr = l1;
        ListNode l2Curr = l2;
        int add = 0;
        while (l1Curr != null || l2Curr != null || add != 0) {
            int l1Val = l1Curr != null ? l1Curr.val : 0;
            int l2Val = l2Curr != null ? l2Curr.val : 0;

            ListNode indexNode = new ListNode();
            int addValue = l1Val + l2Val;
            addValue = addValue + add;
            add = addValue / 10;
            int result = addValue % 10;
            indexNode.val = result;
            addNode.next = indexNode;
            addNode = addNode.next;
            if (l1Curr != null) l1Curr = l1Curr.next;
            if (l2Curr != null) l2Curr = l2Curr.next;
        }

        return head.next;
    }
}