随笔分类 -  leetcode

摘要：方法一：bottom-upNode *LCA(Node *root, Node *p, Node *q) { if (!root) return NULL; if (root == p || root == q) return root; Node *left = LCA(root->left... 阅读全文

摘要：class Solution {public: int kthSmallest(TreeNode* root, int k) { int num = 0; TreeNode*pNode=NULL; visit(root, k, num, pNode);... 阅读全文

摘要：class Solution {public: vector twoSum(vector &numbers, int target) { vector ret(2,-1); unordered_map m; //value->index map ... 阅读全文

摘要：class Solution {public: string longestPalindrome(string s) { int length=s.length(); int maxlen=0; int start=0; bool fla... 阅读全文

摘要：int lengthOfLastWord(char*str){ int length=strlen(str); char*pBegin=str; char*pEnd=str+length; while(*pEnd==''){ ... 阅读全文