MergeTwoSortedLists

Author: Igor Karpov

result/merge-two-sorted-lists.php

@@ -0,0 +1,31 @@
+<?php
+
+/**
+ * Result: https://leetcode.com/submissions/detail/530298508/
+ */
+
+require "../vendor/autoload.php";
+
+use Leetcode\MergeTwoSortedLists\Solution;
+use Leetcode\MergeTwoSortedLists\ListNode;
+function fillNode($array)
+{
+    arsort($array);
+    $node = null;
+    if (sizeof($array)) {
+        foreach ($array as $val) {
+            $node = new ListNode($val, $node);
+        }
+        return $node;
+    }
+}
+$l1 = [-4, 1];
+$l2 = [-7,-7,-5,-3,0];
+
+$solution = new Solution();
+
+$node1 = fillNode($l1);
+$node2 = fillNode($l2);
+
+$merged_node = $solution->mergeTwoLists($node1, $node2);
+var_dump($merged_node);

src/MergeTwoSortedLists/ListNode.php

@@ -0,0 +1,13 @@
+<?php
+namespace Leetcode\MergeTwoSortedLists;
+class ListNode
+{
+    public $val = 0;
+    public $next = null;
+
+    public function __construct($val = 0, $next = null)
+    {
+        $this->val = $val;
+        $this->next = $next;
+    }
+}

src/MergeTwoSortedLists/Solution.php

@@ -8,59 +8,34 @@
  * Difficulty: Easy
  * Description: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
  * Author: Igor Karpov <[email protected]>
- * Date: 14.01.20
+ * Date: 29.07.21
  * Time: 01:14
  * Class Solution
  * @package Leetcode\MergeTwoSortedLists
  */
 
-/**
- * Definition for a singly-linked list.
- * class ListNode {
- *     public $val = 0;
- *     public $next = null;
- *     function __construct($val) { $this->val = $val; }
- * }
- */
 class Solution {
 
     /**
      * @param ListNode $l1
      * @param ListNode $l2
      * @return ListNode
      */
-//    function mergeTwoLists($l1, $l2) {
-//        print_r($l1);
-//
-//        if(is_null($l1)) {
-//            return $l2;
-//        }
-//        if(is_null($l2)) {
-//            return $l1;
-//        }
-//        //make head
-//        if($l1->val <= $l2->val) {
-//            $mergedList = new ListNode($l1);
-//            $l1 = $l1->next;
-//        }
-//        else {
-//            $mergedList = new ListNode($l2);
-//            $l2 = $l2->next;
-//
-//        }
-//        print_r($mergedList);
-//
-//        while(!is_null($l1) && !is_null($l2)) {
-//            if($l1->val <= $l2->val) {
-//                $mergedList->next = new ListNode($l1);
-//                $l1 = $l1->next;
-//            }
-//            else {
-//                $mergedList->next = new ListNode($l2);
-//                $l2 = $l2->next;
-//            }
-//        }
-//        print_r($mergedList);
-//    }
-//
+    function mergeTwoLists($l1, $l2) {
+
+        if(is_null($l1)) {
+            return $l2;
+        }
+        if(is_null($l2)) {
+            return $l1;
+        }
+        if($l1->val < $l2->val) {
+            $l1->next = $this->mergeTwoLists($l1->next, $l2);
+            return $l1;
+        }
+        else {
+            $l2->next = $this->mergeTwoLists($l2->next, $l1);
+            return $l2;
+        }
+    }
 }