llllmz

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool inorder(struct 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ struct TreeNode* me 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ int findBottomLeftV 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ int preorder(struct 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ /** * Note: The ret 阅读全文

摘要： int tribonacci(int n){ int* dp=(int*)malloc(sizeof(int)*(n+4)); dp[0]=0,dp[1]=1,dp[2]=1; for(int i=3;i<=n;i++) dp[i]=dp[i-1]+dp[i-2]+dp[i-3]; return d 阅读全文

摘要： int findMaxConsecutiveOnes(int* nums, int numsSize) { int max=0,sum=0,index=0; while(index<numsSize){ if(nums[index]==1){ sum++; if(sum>max) max=sum; 阅读全文

摘要： 这是很难得题目，标准解的二分查找，以后要掌握。 int stockManagement(int* stock, int stockSize) { int min=stock[0]; for(int i=1;i<stockSize;i++){ if(stock[i]<min) min=stock[i] 阅读全文

摘要： // The API isBadVersion is defined for you. // bool isBadVersion(int version); int firstBadVersion(int n) { int head=1,tail=n; if(isBadVersion(head)) 阅读全文

摘要： 树遍历的变形 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ struct TreeN 阅读全文