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 / ThreadPool.cpp
Created December 31, 2018 07:16
class Task
{
public:
Task(int i)
{
id = i;
}
void virtual run()
@kanrourou
kanrourou / Check Completeness of a Binary Tree_2.cpp
Last active December 30, 2018 01:50
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
@kanrourou
kanrourou / Check Completeness of a Binary Tree.cpp
Created December 30, 2018 01:38
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
@kanrourou
kanrourou / Valid Number.cpp
Created December 28, 2018 20:26
class Solution {
public:
bool isNumber(string s) {
vector<vector<int>> transferTable = {
{1, 2, 3, -1, -1},
{-1, 2, 3, -1, -1},
{-1, 2, 4, 5, -1},
{-1, 4, -1, -1, -1},
{-1, 4, -1, 5, -1},
{6, 7, -1, -1, -1},
@kanrourou
kanrourou / Merge k Sorted Lists.cpp
Created December 26, 2018 19:42
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Remove Duplicates from Sorted List II.cpp
Created December 26, 2018 04:51
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Remove Duplicates from Sorted List.cpp
Created December 26, 2018 04:41
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Sort List.cpp
Created December 26, 2018 04:29
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Reorder List.cpp
Created December 26, 2018 02:31
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
@kanrourou
kanrourou / Partition List.cpp
Created December 26, 2018 02:04
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public: