aboutsummaryrefslogtreecommitdiff
path: root/reverse_node_k.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-02-03 15:37:19 -0700
committerJack Sangdahl <[email protected]>2025-02-03 15:37:19 -0700
commit55a67f776dd9acd258cae16ffb636751666b0f40 (patch)
tree601539de43809b70ceb8228a12c35883fa300b03 /reverse_node_k.cpp
parenta0030873dabb517594ae0394350d6715071f7fb8 (diff)
downloadleetcode-55a67f776dd9acd258cae16ffb636751666b0f40.tar.gz
leetcode-55a67f776dd9acd258cae16ffb636751666b0f40.zip
chore: Remove incomplete solutions
Diffstat (limited to 'reverse_node_k.cpp')
-rw-r--r--reverse_node_k.cpp26
1 files changed, 0 insertions, 26 deletions
diff --git a/reverse_node_k.cpp b/reverse_node_k.cpp
deleted file mode 100644
index e57291a..0000000
--- a/reverse_node_k.cpp
+++ /dev/null
@@ -1,26 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- ListNode *reverseKGroup(ListNode *head, int k) {
- ListNode *cursor = head;
- for (int i = 0; i < k; i++) {
- if (cursor == nullptr)
- return head;
- cursor = cursor->next;
- }
- ListNode *curr = head;
- ListNode *prev = nullptr;
- ListNode *next = nullptr;
- for (int i = 0; i < k; i++) {
- next = curr->next;
- curr->next = prev;
- prev = curr;
- curr = next;
- }
- head->next = reverseKGroup(curr, k);
- return prev;
- }
-};
-
-int main() {}