/* Reverse linked-list from position n to m i.e. head->1->2->3->4->5->Null n = 2, m = 4 new list head->1->4->3->2->5->Null. */ /* input 5 lenght of list. 2 4 n and m 1 2 3 4 5 list elements... */ #include #include #include using namespace std; typedef struct node { int data; struct node *next; }node; //node *head_nxt, *head_new; void insert(node **temp, int val) { while((*temp)->next != nullptr) (*temp) = (*temp)->next; (*temp)->next = (node *)(malloc(sizeof(node))); *temp = (*temp)->next; (*temp)->data=val; } /* node* reverse(node **temp,node **tempN) { if((*tempN)->next->next != nullptr) { node *ptr = (*tempN)->next; ptr->next=reverse(&(*temp)->next,&(*tempN)->next); cout<data<<"->"<next->data<<"!!!"; } else { head_nxt = (*tempN)->next; head_new = *tempN; return *temp; } } */ int main() { int n,i,val,str,end; node *head = nullptr; node *temp, *start, *pre=nullptr, *pre_p, *curr, *nxt; cout<< "Enter the no. of length."<>n; cout<< "Enter "<>str>>end; int hint = str; for(i=0; i>val; if(head == nullptr) { head = (node *)(malloc(sizeof(node))); head->data = val; head->next = nullptr; } else { temp=head; insert(&temp, val); } } // temp = head; /* int r = temp->data + add_One(&temp); if(r > 9) { temp = (node *)(malloc(sizeof(node))); temp->data = 1; temp->next=head; head=temp; } reverse(&temp,&(temp)->next); head->next = head_nxt; head = head_new; */ curr = head; end -= str; while(str-- > 1) { nxt = curr->next; pre = curr; curr = nxt; } start = curr; pre_p = pre; while(end+1 > 0) { nxt = curr->next; curr->next = pre; pre = curr; curr = nxt; end--; } start->next = curr; if(hint == 1) head = pre; else pre_p->next = pre; temp=head; cout<data; temp=temp->next; } return 0; }

reverse-list...