-
Notifications
You must be signed in to change notification settings - Fork 0
/
17-04
72 lines (68 loc) · 1.57 KB
/
17-04
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
if(head == NULL){
return head;
}
ListNode* cur = head;
while(cur->next != NULL){
if(cur->next->val == val){
cur->next = cur->next->next;
}
else{
cur = cur->next;
}
}
}
};
class Solution {
public:
bool hasCycle(ListNode *head) {
ListNode* slow = head;
ListNode* fast = head;
while(fast != NULL and fast->next != NULL){
slow = slow->next;
fast = fast->next->next;
if(slow == fast){
return 1;
}
}
return 0;
}
};
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
ListNode* curr= head;
while(curr and curr->next){
if(curr->val==curr->next->val){
curr->next=curr->next->next;
}
else{
curr=curr->next;
}
}
return head;
}
};
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* startNode = NULL;
if(l1 == NULL){
return l2;
}
if(l2 == NULL){
return l1;
}
if(l1->val <= l2->val){
startNode = l1;
startNode->next = mergeTwoLists(l1->next, l2);
}
else{
startNode = l2;
startNode->next = mergeTwoLists(l1, l2->next);
}
return startNode;
}
};