[text] lmao

Viewer

  1. /**
  2.  * Definition for singly-linked list.
  3.  * struct ListNode {
  4.  *     int val;
  5.  *     ListNode *next;
  6.  *     ListNode() : val(0), next(nullptr) {}
  7.  *     ListNode(int x) : val(x), next(nullptr) {}
  8.  *     ListNode(int x, ListNode *next) : val(x), next(next) {}
  9.  * };
  10.  */
  11. class Solution {
  12. public:
  13.     ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
  14.         
  15.         boolean over = false;
  16.         ListNode headNode = new ListNode();
  17.         ListNode currentNode = headNode;
  18.         
  19.         boolean carryOver = false;
  20.         while(!over) {
  21.             int sum = 0;
  22.             if(l1 == null && l2 == null && !carryOver) {
  23.                 over = true;
  24.             }
  25.             else {
  26.                 if(carryOver) {
  27.                     sum++;
  28.                     carryOver = false;
  29.                 }
  30.                 if(l1 != null) {
  31.                     sum += l1.val;
  32.                     l1 = (l1.next == null) ? null : l1.next;
  33.                 }
  34.                 if(l2 != null) {
  35.                     sum += l2.val;
  36.                     l2 = (l2.next == null) ? null : l2.next;
  37.                 }
  38.                 
  39.                 if(sum >= 10) {
  40.                     carryOver = true;
  41.                     sum -= 10;
  42.                 }
  43.                 
  44.                 currentNode.val = sum;
  45.                 currentNode.next = new ListNode();
  46.                 currentNode = currentNode.next;
  47.             
  48.             }
  49.         }
  50.         return headNode;
  51.     }
  52. };

Editor

You can edit this paste and save as new:


File Description
  • lmao
  • Paste Code
  • 15 Jun-2021
  • 1.47 Kb
You can Share it: