日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

LeetCode--Add Two Numbers

發布時間:2025/3/12 编程问答 33 豆豆
生活随笔 收集整理的這篇文章主要介紹了 LeetCode--Add Two Numbers 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

題目見:https://leetcode.com/problems/add-two-numbers/


You are given two?non-empty?linked lists representing two non-negative integers. The digits are stored in?reverse order?and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 Explanation: 342 + 465 = 807.

這道題簡單講就是輸入兩個鏈表,將其逆序排列成數字后相加,并將結果逆序排列成鏈表輸出

我的想法是:

  • 先將兩個鏈表從第一個開始兩兩相加,放入一個鏈表中
  • 將鏈表轉化為給定格式返回

  • 代碼見:https://github.com/Wen-Xueliang/LeetCode/blob/master/src/main/java/eng/lab/leetcode/algorithms/TwoSum.java

    時間與空間使用信息

    Runtime:?4 ms, faster than?8.40%?of?Java?online submissions for?Add Two Numbers.

    Memory Usage:?45 MB, less than?84.01%?of?Java?online submissions for?Add Two Numbers.

    public class AddTwoNumbers {public ListNode addTwoNumbers(ListNode l1, ListNode l2) {ListNode result = null;ListNode currentNode1 = l1;ListNode currentNode2 = l2;List<Integer> list = new ArrayList<Integer>();int carry = 0;while(true) {int node1Value = 0;int node2Value = 0;if(currentNode1 == null && currentNode2 == null) {if(carry == 1) list.add(carry);break;} else if(currentNode1 == null){node2Value = currentNode2.val;currentNode2 = currentNode2.next;} else if(currentNode2 == null){node1Value = currentNode1.val;currentNode1 = currentNode1.next;} else {node1Value = currentNode1.val;node2Value = currentNode2.val;currentNode1 = currentNode1.next;currentNode2 = currentNode2.next;}int sum = node1Value + node2Value + carry;if(sum > 9) {carry = 1;sum -= 10;} else {carry = 0;}list.add(sum);}for(int i = list.size() - 1; i >= 0; i --) {ListNode currentNode = null;if(result == null) {result = new ListNode(list.get(i));} else {currentNode = new ListNode(list.get(i));currentNode.next = result;result = currentNode;}}return result;}public static class ListNode {int val;ListNode next;ListNode(int x) { val = x; }} }

    總結

    以上是生活随笔為你收集整理的LeetCode--Add Two Numbers的全部內容,希望文章能夠幫你解決所遇到的問題。

    如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。