forked from LeetCode-in-Php/LeetCode-in-Php
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
32 changed files
with
1,305 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,46 @@ | ||
| <?php | ||
|
|
||
| namespace leetcode\com_github_leetcode\random; | ||
|
|
||
| class Node { | ||
| public $val; | ||
| public $next; | ||
| public $random; | ||
|
|
||
| function __construct($val = 0, $next = null, $random = null) { | ||
| $this->val = $val; | ||
| $this->next = $next; | ||
| $this->random = $random; | ||
| } | ||
|
|
||
| function __toString() { | ||
| $result = array(); | ||
| $result2 = array(); | ||
| array_push($result2, strval($this->val)); | ||
| if ($this->random == null) { | ||
| array_push($result2, "null"); | ||
| } else { | ||
| array_push($result2, strval($this->random->val)); | ||
| } | ||
| array_push($result, "[" . implode(",", $result2) . "]"); | ||
| $curr = $this->next; | ||
| while ($curr != null) { | ||
| $result3 = array(); | ||
| array_push($result3, strval($curr->val)); | ||
| if ($curr->random == null) { | ||
| array_push($result3, "null"); | ||
| } else { | ||
| $randomIndex = 0; | ||
| $curr2 = $this; | ||
| while ($curr2->next != null && $curr2 != $curr->random) { | ||
| $randomIndex += 1; | ||
| $curr2 = $curr2->next; | ||
| } | ||
| array_push($result3, strval($randomIndex)); | ||
| } | ||
| array_push($result, "[" . implode(",", $result3) . "]"); | ||
| $curr = $curr->next; | ||
| } | ||
| return "[" . implode(",", $result) . "]"; | ||
| } | ||
| } |
68 changes: 68 additions & 0 deletions
68
src/main/php/g0101_0200/s0138_copy_list_with_random_pointer/Solution.php
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,68 @@ | ||
| <?php | ||
|
|
||
| namespace leetcode\g0101_0200\s0138_copy_list_with_random_pointer; | ||
|
|
||
| // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List | ||
| // #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) | ||
| // #2023_12_17_Time_2300_ms_(60.00%)_Space_22.7_MB_(60.00%) | ||
|
|
||
| use leetcode\com_github_leetcode\random\Node; | ||
|
|
||
| /** | ||
| * Definition for a Node. | ||
| * class Node { | ||
| * public $val = null; | ||
| * public $next = null; | ||
| * public $random = null; | ||
| * function __construct($val = 0) { | ||
| * $this->val = $val; | ||
| * $this->next = null; | ||
| * $this->random = null; | ||
| * } | ||
| * } | ||
| */ | ||
| class Solution { | ||
| /** | ||
| * @param Node $head | ||
| * @return Node | ||
| */ | ||
| public function copyRandomList($head) { | ||
| if ($head == null) { | ||
| return null; | ||
| } | ||
| $curr = $head; | ||
| while ($curr != null) { | ||
| $clonedNode = new Node($curr->val); | ||
| $clonedNode->next = $curr->next; | ||
| $curr->next = $clonedNode; | ||
| $curr = $clonedNode->next; | ||
| } | ||
| $curr = $head; | ||
| while ($curr != null) { | ||
| if ($curr->random != null) { | ||
| $curr->next->random = $curr->random->next; | ||
| } else { | ||
| $curr->next->random = null; | ||
| } | ||
| $curr = $curr->next->next; | ||
| } | ||
| $curr = $head; | ||
| $newHead = null; | ||
| while ($curr != null) { | ||
| if ($newHead == null) { | ||
| $clonedNode = $curr->next; | ||
| $newHead = $clonedNode; | ||
| } else { | ||
| $clonedNode = $curr->next; | ||
| } | ||
| $curr->next = $clonedNode->next; | ||
| if ($curr->next != null) { | ||
| $clonedNode->next = $curr->next->next; | ||
| } else { | ||
| $clonedNode->next = null; | ||
| } | ||
| $curr = $curr->next; | ||
| } | ||
| return $newHead; | ||
| } | ||
| } |
Oops, something went wrong.