leetcode题
小陈往事
这个作者很懒,什么都没留下…
展开
-
Validate Binary Search Tree
#include<iostream>#include<vector>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(int val):val(val),left(NULL),right(NULL){};};class Soluti原创 2015-07-17 11:15:20 · 219 阅读 · 0 评论 -
[leetcode]Convert Sorted Array to Binary Search Tree
#include<iostream>#include<vector>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(int val):val(val),left(NULL),right(NULL){};};class Soluti原创 2015-07-17 14:51:07 · 207 阅读 · 0 评论 -
[leetcode] Convert Sorted List to Binary Search Tree
#include<iostream>#include<vector>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(int val):val(val),left(NULL),right(NULL){};};struct ListN原创 2015-07-17 16:32:49 · 228 阅读 · 0 评论 -
[leetcode]First Missing Positive
#include<iostream>using namespace std;void findfirstpositive(int a[],int length){ for(int i=0;i<length;i++) { if(a[i]>0&&a[i]<=length&&i!=a[i]-1) { swap(a[i],a[a[i原创 2015-07-20 17:13:51 · 203 阅读 · 0 评论 -
[leetcode] Insertion Sort List
#include<iostream>using namespace std;struct ListNode{ int value; ListNode* next; ListNode(int value):value(value),next(NULL){};};ListNode* Insertsort(ListNode* head){ if(!head)原创 2015-07-20 15:47:37 · 220 阅读 · 0 评论 -
[leetcode]Search a 2D Matrix
#include<iostream>#include<vector>using namespace std;class Solution{public: bool find(vector<vector<int>>a,int target) { int l=0; int r=a.size()*a.back().size()-1;原创 2015-07-24 17:07:14 · 182 阅读 · 0 评论 -
[leetcode]Search Insert Position
#include<iostream>#include<vector>using namespace std;class Solution{public: int findindex(vector<int>a,int target) { if(a.empty()) return 0; int first=0,last=a原创 2015-07-24 17:24:23 · 180 阅读 · 0 评论 -
[leetcode]Search for a Range
#include<iostream>#include<vector>using namespace std;class Solution1{public: vector<int> findindex(vector<int>a,int target) { vector<int>res; int first=0,last=a.size()-1;原创 2015-07-24 21:56:12 · 205 阅读 · 0 评论 -
[leetcode]Word Ladder
#include<iostream>#include<string>#include<set>#include<unordered_set>#include<unordered_map>#include<map>#include<deque>using namespace std;class Solution{public: int wordladder(string s原创 2015-07-25 15:03:23 · 212 阅读 · 0 评论