initial commit

Author: WayneJr

214854

@@ -0,0 +1,92 @@
+// implement a linked list with a dummy node
+
+#include <cstdlib>
+#include <iostream>
+using namespace std;
+
+class Node {
+ public:
+  Node(int d = 0, Node *n = NULL) {
+    data = d;
+    next = n;
+  }
+  int data;
+  Node *next;
+};
+
+class List {
+ public:
+  List();
+  ~List();
+  void insert(int d);
+  void remove(int d);
+  void print();
+
+ private:
+  Node *head;
+};
+
+List::List() {
+  head = new Node;
+  head->next = NULL;
+}
+
+List::~List() {
+  Node *p = head;
+  while (p != NULL) {
+    Node *q = p;
+    p = p->next;
+    delete q;
+  }
+}
+
+void List::insert(int d) {
+  Node *p = head;
+  while (p->next != NULL && p->next->data < d) p = p->next;
+  p->next = new Node(d, p->next);
+}
+
+void List::remove(int d) {
+  Node *p = head;
+  while (p->next != NULL && p->next->data < d) p = p->next;
+  if (p->next != NULL && p->next->data == d) {
+    Node *q = p->next;
+    p->next = q->next;
+    delete q;
+  }
+}
+
+void List::print() {
+  Node *p = head->next;
+  while (p != NULL) {
+    cout << p->data << " ";
+    p = p->next;
+  }
+  cout << endl;
+}
+
+int main() {
+  List list;
+  int n;
+  cin >> n;
+  for (int i = 0; i < n; i++) {
+    int d;
+    cin >> d;
+    list.insert(d);
+  }
+  list.print();
+  int m;
+  cin >> m;
+  for (int i = 0; i < m; i++) {
+    int d;
+    cin >> d;
+    list.remove(d);
+  }
+  list.print();
+  return 0;
+}
+
+// Path: 214855.cpp
+// Delete
+// restore
+// insert

214854.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+
+class Node {
+public:
+  int data;
+  Node* next;
+
+  // Default constructor
+  Node() {
+    data = 0;
+    next = NULL;
+  }
+
+  Node(int data) {
+    this->data = data;
+    this->next = NULL;
+  }
+};

a.out

@@ -0,0 +1,22 @@
+#include <stdio.h>
+
+int sum(int k);
+
+int main() {
+  int boys = 4;
+  int* ptr = &boys;
+  // printf("There are %d boys", boys);
+  // printf("Hello World!");
+  // printf("%d", *ptr);
+  int result = sum(5);
+  printf("%d", result);
+  return 0;
+}
+
+int sum(int k) {
+  if (k == 0) {
+    return 0;
+  } else {
+    return k + sum(k - 1);
+  }
+}

geeks.cpp

@@ -0,0 +1,124 @@
+// Cpp implementation of a LinkedList class with an data, key, and next pointer
+// Path: last-test.cpp
+
+// Cpp program to implement linked list data structure as [(1, 10), (2, 20), (3,
+// 30)]
+#include <iostream>
+using namespace std;
+
+class Node {
+ public:
+  int data;
+  int key;
+  Node* next;
+
+  // Default constructor
+  Node() {
+    data = 0;
+    next = NULL;
+  }
+
+  Node(int key, int data) {
+    this->data = data;
+    this->key = key;
+    this->next = NULL;
+  }
+
+  // Destructor
+  ~Node() { cout << "Node with key " << key << " is being deleted" << endl; }
+
+  // Print the data of the node
+  void printNode() { cout << "(" << key << ", " << data << ")"; }
+};
+
+class LinkedList {
+ public:
+  Node* head;
+
+  // Default constructor
+  LinkedList() { head = NULL; }
+
+  // Insert a node at the index entered
+  void insert(int index, int data) {
+    Node* newNode = new Node(index, data);
+    if (index == 1) {
+      newNode->next = head;
+      head = newNode;
+      return;
+    }
+    Node* temp = head;
+    cout << index << endl;
+    for (int i = 1; i < index - 2; i++) {
+      temp = temp->next;
+    }
+    newNode->next = temp->next;
+    temp->next = newNode;
+  }
+
+  // Delete a node at the index entered
+  void deleteNode(int index) {
+    Node* temp = head;
+    if (index == 1) {
+      head = temp->next;
+      delete temp;
+      return;
+    }
+    for (int i = 1; i < index - 2; i++) {
+      temp = temp->next;
+    }
+    Node* temp1 = temp->next;
+    temp->next = temp1->next;
+    delete temp1;
+  }
+
+  void reverse() {
+    Node* prev = NULL;
+    Node* current = head;
+    Node* next = NULL;
+    while (current != NULL) {
+      next = current->next;
+      current->next = prev;
+      prev = current;
+      current = next;
+    }
+    head = prev;
+  }
+
+  // Print the data of the linked list
+  void printList() {
+    Node* temp = head;
+    cout << "[";
+    while (temp != NULL) {
+      temp->printNode();
+      temp = temp->next;
+    }
+    cout << "]" << endl;
+  }
+
+  // sort the linked list
+
+  // Destructor
+  ~LinkedList() { cout << "List is being deleted" << endl; }
+};
+
+int main() {
+  LinkedList list;
+  list.insert(1, 10);
+  list.insert(3, 30);
+  list.insert(2, 20);
+  // list.insert(4, 40);
+  // list.insert(5, 50);
+  // list.insert(6, 60);
+  cout << "Original List";
+  list.printList();
+
+  list.reverse();
+  list.printList();
+  // list.deleteNode(1);
+  // list.printList();
+  // list.deleteNode(3);
+  // list.printList();
+  // list.deleteNode(5);
+  // list.printList();
+  return 0;
+}