Skip to content

Commit a576d22

Browse files
committed
Add time and space complexity analysis for Topic 2 solutions
1 parent a4f6aed commit a576d22

7 files changed

Lines changed: 22 additions & 66 deletions

Topic2_LinkedList/dkhien/01ReverseLinkedList.java

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,6 @@
1+
// Time Complexity: O(n)
2+
// Space Complexity: O(1)
3+
14
class Solution {
25
public ListNode reverseList(ListNode head) {
36
if (head == null) return null;

Topic2_LinkedList/dkhien/02MergeTwoSortedLists.java

Lines changed: 3 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,6 @@
1-
/**
2-
* Definition for singly-linked list.
3-
* public class ListNode {
4-
* int val;
5-
* ListNode next;
6-
* ListNode() {}
7-
* ListNode(int val) { this.val = val; }
8-
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
9-
* }
10-
*/
1+
// Time Complexity: O(n)
2+
// Space Complexity: O(1)
3+
114
class Solution {
125
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
136
ListNode result = new ListNode();

Topic2_LinkedList/dkhien/03ReorderList.java

Lines changed: 3 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,6 @@
1-
/**
2-
* Definition for singly-linked list.
3-
* public class ListNode {
4-
* int val;
5-
* ListNode next;
6-
* ListNode() {}
7-
* ListNode(int val) { this.val = val; }
8-
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
9-
* }
10-
*/
1+
// Time Complexity: O(n)
2+
// Space Complexity: O(n)
3+
114
class Solution {
125
public void reorderList(ListNode head) {
136
List<ListNode> nodeList = new ArrayList<>();

Topic2_LinkedList/dkhien/04RemoveNthNodeFromEndOfList.java

Lines changed: 3 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,6 @@
1-
/**
2-
* Definition for singly-linked list.
3-
* public class ListNode {
4-
* int val;
5-
* ListNode next;
6-
* ListNode() {}
7-
* ListNode(int val) { this.val = val; }
8-
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
9-
* }
10-
*/
1+
// Time Complexity: O(n)
2+
// Space Complexity: O(1)
3+
114
class Solution {
125
public ListNode removeNthFromEnd(ListNode head, int n) {
136
if (head == null || head.next == null) return null;

Topic2_LinkedList/dkhien/05CopyListWithRandomPointer.java

Lines changed: 2 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,5 @@
1-
/*
2-
// Definition for a Node.
3-
class Node {
4-
int val;
5-
Node next;
6-
Node random;
7-
8-
public Node(int val) {
9-
this.val = val;
10-
this.next = null;
11-
this.random = null;
12-
}
13-
}
14-
*/
1+
// Time Complexity: O(n)
2+
// Space Complexity: O(n)
153

164
class Solution {
175
public Node copyRandomList(Node head) {

Topic2_LinkedList/dkhien/06AddTwoNumbers.java

Lines changed: 3 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,6 @@
1-
/**
2-
* Definition for singly-linked list.
3-
* public class ListNode {
4-
* int val;
5-
* ListNode next;
6-
* ListNode() {}
7-
* ListNode(int val) { this.val = val; }
8-
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
9-
* }
10-
*/
1+
// Time Complexity: O(n)
2+
// Space Complexity: O(1)
3+
114
class Solution {
125
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
136
ListNode dummy = new ListNode();

Topic2_LinkedList/dkhien/07LinkedListCycle.java

Lines changed: 5 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,10 @@
1-
/**
2-
* Definition for singly-linked list.
3-
* class ListNode {
4-
* int val;
5-
* ListNode next;
6-
* ListNode(int x) {
7-
* val = x;
8-
* next = null;
9-
* }
10-
* }
11-
*/
1+
// Time Complexity: O(n)
2+
// Space Complexity: O(1)
3+
124
public class Solution {
135
public boolean hasCycle(ListNode head) {
14-
if (head == null) return false;
6+
if (head == null)
7+
return false;
158
ListNode slow = head;
169
ListNode fast = head;
1710

0 commit comments

Comments
 (0)