weixin_38383877的博客

#include<iostream> #include<algorithm> #include<queue> using namespace std; //5种情况：空树；没有子树；只有左/右子树；有俩子树； struct BinaryNode { BinaryNode *left; BinaryNode *right; int data; }; s...

Given a stringsand a dictionary of wordsdict, add spaces insto construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens="catsan...

#include<iostream> #include<vector> #include<stack> using namespace std; // Definition for binary tree 先序遍历 根左右 struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeN...

#include<iostream> #include<vector> #include<stack> using namespace std; // Definition for binary tree 先序遍历 根左右 struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeN...

/*Given a string s and a dictionary of words dict, determine if s can be segmented into a space - separated sequence of one or more dictionary words. For example, given s = "leetcode", dict = ["lee...

判断链表是不是循环链表 #include<iostream> #include<vector> using namespace std; /* Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space?*/ s...

#include<iostream> #include<vector> using namespace std; //Definition for singly-linked list. /*Given a singly linked list L : L 0→L 1→…→L n - 1→L n, reorder it to : L 0→L n →L 1→L n - 1→...

Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line. Input: [[1,1],[2,2],[3,3]] Output: 3 Input: [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]] Output: 4 ...

Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are+,-,*,/. Each operand may be an integer or another expression. Some examples: ["2", "1", "+", "3", ...

#include<iostream> using namespace std; struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; #if 0 class Solution { public: ListNode *insertionSortList(...

#include<iostream> using namespace std; //Sort a linked list in O(n log n) time using constant space complexity. //Definition for singly-linked list. //归并排序 #if 0 struct ListNode { int v...