Merge pull request ByteByteGoHq#21 from ongshunping/cpp-solutions-linked-lists

Destiny-02 · web-flow · commit 6e1845e144e7 · 2025-01-13T18:25:19.000+11:00
Chapter 3 (Linked List) [C++]: Include Dependencies and Remove Prototypes
diff --git a/cpp/Linked Lists/flatten_multi_level_list.cpp b/cpp/Linked Lists/flatten_multi_level_list.cpp
@@ -1,3 +1,6 @@
+#include "ds/MultiLevelListNode.h"
+using ds::MultiLevelListNode;
+
 /**
  * Definition of MultiLevelListNode:
  * class MultiLevelListNode {
diff --git a/cpp/Linked Lists/linked_list_intersection.cpp b/cpp/Linked Lists/linked_list_intersection.cpp
@@ -1,3 +1,6 @@
+#include "ds/ListNode.h"
+using ds::ListNode;
+
 /**
  * Definition of ListNode:
  * struct ListNode {
diff --git a/cpp/Linked Lists/linked_list_reversal.cpp b/cpp/Linked Lists/linked_list_reversal.cpp
@@ -1,3 +1,6 @@
+#include "ds/ListNode.h"
+using ds::ListNode;
+
 /**
  * Definition of ListNode:
  * struct ListNode {
diff --git a/cpp/Linked Lists/linked_list_reversal_recursive.cpp b/cpp/Linked Lists/linked_list_reversal_recursive.cpp
@@ -1,3 +1,6 @@
+#include "ds/ListNode.h"
+using ds::ListNode;
+
 /**
  * Definition of ListNode:
  * struct ListNode {
diff --git a/cpp/Linked Lists/palindromic_linked_list.cpp b/cpp/Linked Lists/palindromic_linked_list.cpp
@@ -1,3 +1,6 @@
+#include "ds/ListNode.h"
+using ds::ListNode;
+
 /**
  * Definition of ListNode:
  * struct ListNode {
@@ -7,11 +10,6 @@
  * };
  */
 
-// Function prototypes
-ListNode* findMiddle(ListNode* head);
-ListNode* reverseList(ListNode* head);
-bool palindromicLinkedList(ListNode* head);
-
 bool palindromicLinkedList(ListNode* head) {
     // Find the middle of the linked list and then reverse the second half of the
     // linked list starting at this midpoint.
diff --git a/cpp/Linked Lists/remove_kth_last_node.cpp b/cpp/Linked Lists/remove_kth_last_node.cpp
@@ -1,3 +1,6 @@
+#include "ds/ListNode.h"
+using ds::ListNode;
+
 /**
  * Definition of ListNode:
  * struct ListNode {
