Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- class SinglyLinkedListNode {
- public:
- int data;
- SinglyLinkedListNode *next;
- SinglyLinkedListNode(int node_data) {
- this->data = node_data;
- this->next = nullptr;
- }
- };
- class SinglyLinkedList {
- public:
- SinglyLinkedListNode *head;
- SinglyLinkedListNode *tail;
- SinglyLinkedList() {
- this->head = nullptr;
- this->tail = nullptr;
- }
- void insert_node(int node_data) {
- SinglyLinkedListNode* node = new SinglyLinkedListNode(node_data);
- if (!this->head) {
- this->head = node;
- } else {
- this->tail->next = node;
- }
- this->tail = node;
- }
- };
- void print_singly_linked_list(SinglyLinkedListNode* node, string sep, ofstream& fout) {
- while (node) {
- fout << node->data;
- node = node->next;
- if (node) {
- fout << sep;
- }
- }
- }
- void free_singly_linked_list(SinglyLinkedListNode* node) {
- while (node) {
- SinglyLinkedListNode* temp = node;
- node = node->next;
- free(temp);
- }
- }
- // Complete the insertNodeAtPosition function below.
- /*
- * For your reference:
- *
- * SinglyLinkedListNode {
- * int data;
- * SinglyLinkedListNode* next;
- * };
- *
- */
- SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* head, int data, int position)
- {
- SinglyLinkedListNode *p,*q;
- p=head;
- q=new SinglyLinkedListNode;
- q->data=data;
- q->next=NULL;
- int i=1;
- while(i<position)
- {
- p=p->next;
- i++;
- }
- SinglyLinkedListNode *temp=p->next;
- p->next=q;
- q->next=temp;
- return head;
- }
- int main()
- {
- ofstream fout(getenv("OUTPUT_PATH"));
- SinglyLinkedList* llist = new SinglyLinkedList();
- int llist_count;
- cin >> llist_count;
- cin.ignore(numeric_limits<streamsize>::max(), '\n');
- for (int i = 0; i < llist_count; i++) {
- int llist_item;
- cin >> llist_item;
- cin.ignore(numeric_limits<streamsize>::max(), '\n');
- llist->insert_node(llist_item);
- }
- int data;
- cin >> data;
- cin.ignore(numeric_limits<streamsize>::max(), '\n');
- int position;
- cin >> position;
- cin.ignore(numeric_limits<streamsize>::max(), '\n');
- SinglyLinkedListNode* llist_head = insertNodeAtPosition(llist->head, data, position);
- print_singly_linked_list(llist_head, " ", fout);
- fout << "\n";
- free_singly_linked_list(llist_head);
- fout.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement