leetcode
呆呆啊
这个作者很懒,什么都没留下…
展开
-
[LeetCode]Valid Number
class Solution {public: bool isNumber(string s) { bool is_num =false; bool before =false; int s_length = s.length(); int i =0; while(ii] ==' '原创 2016-09-14 14:44:13 · 192 阅读 · 0 评论 -
[LeetCode]Recover Binary Search Tree
class Solution {public: void recoverTree(TreeNode* root) { vectorTreeNode*> order; inorder(root, &order); for(int i =0;isize();i++){ couti]->val" ";原创 2016-09-14 21:00:38 · 192 阅读 · 0 评论 -
[LeetCode]Same Tree
class Solution {public: bool isSameTree(TreeNode* p,TreeNode* q) { if(p ==NULL&& q ==NULL)return true; if(p ==NULL||q ==NULL)return false; bool is_same =t原创 2016-09-14 22:16:17 · 224 阅读 · 0 评论 -
[LeetCode]Restore IP Addresses
class Solution {public: vectorstring> restoreIpAddresses(string s) { vectorstring> result; if(s.length() ==0) return result; result = restoreIpAddresses(s,0, 0);原创 2016-09-16 20:19:51 · 230 阅读 · 0 评论 -
[LeetCode]Sort Colors
class Solution {public: void sortColors(vectorint>& nums) { int zero_pos =0; int one_pos =0; for(int i =0;isize();i++){ if(nums[i] ==0){原创 2016-09-16 22:50:07 · 215 阅读 · 0 评论 -
[LeetCode] Search in Rotated Sorted Array
#include #include using namespace std;class Solution {public: int search(vector& nums, int target) { bool left; if(target>nums[nums.size()-1]){ left = true;原创 2016-09-05 18:51:02 · 167 阅读 · 0 评论