Skip to content

Instantly share code, notes, and snippets.

View kanrourou's full-sized avatar

Ke Xu kanrourou

6 followers · 2 following
View GitHub Profile
@kanrourou
kanrourou / Insertion Sort List.cpp
Created December 26, 2018 00:19
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Odd Even Linked List.cpp
Created December 26, 2018 00:00
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Remove Nth Node From End of List.cpp
Created December 25, 2018 23:34
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Remove Linked List Elements.cpp
Created December 25, 2018 23:19
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Delete Node in a Linked List.cpp
Created December 25, 2018 22:56
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Middle of the Linked List.cpp
Created December 25, 2018 22:37
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Reverse Nodes in k-Group_recursion.cpp
Created December 25, 2018 20:13
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Reverse Linked List II.cpp
Created December 25, 2018 19:54
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Reverse Linked List_iteration.cpp
Created December 25, 2018 19:32
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Reverse Linked List_recursion.cpp
Created December 25, 2018 19:25
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public: