-
Notifications
You must be signed in to change notification settings - Fork 34
/
DeleteEveryNNodes
79 lines (75 loc) · 1.52 KB
/
DeleteEveryNNodes
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
73
74
75
76
77
78
79
//Implement kReverse(int k) i.e. you reverse first k elements then reverse next k elements and so on
#include <iostream>
class node{
public:
int data;
node * next;
node(int data){
this->data=data;
this->next=NULL;
}
};
using namespace std;
node* takeinput(){
int data;
cin>>data;
node* head=NULL,*tail=NULL;
while(data!=-1){
node *newnode=new node(data);
if(head==NULL) {
head=newnode;
tail=newnode;
}
else{
tail->next=newnode;
tail=newnode;
}
cin>>data;
}
return head;
}
void print(node *head)
{
node*temp=head;
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
node* skipMdeleteN(node *head, int M, int N) {
node* temp = head;
while(temp!=NULL){
for(int i=0;i<M-1;i++){
if(temp!=NULL){
temp=temp->next;
}
else{
break;
}
}
node* p = temp;
if(temp==NULL){
return head;
}
for(int j= 0;j<N;j++){
if(temp!=NULL && temp->next!=NULL && p->next!=NULL){
p=temp->next;
temp->next=p->next;
delete(p);
}
}
temp=temp->next;
}
return head;
}
int main()
{
node* head=takeinput();
int m,n;
cin>>m >> n;
head= skipMdeleteN(head,m,n);
print(head);
return 0;
}