摘要： bug为while(s1[j]==s2[k]&&j++<s1.size()&&k++<s2.size())这句，一开始写的是while(j++<s1.size()&&k++<s2.size()&&s1[j]==s2[k])class Solution {public: string longestCommonPrefix(vector<string> &strs) { if(strs.size()==0)return ""; int minlen=INT_MAX; f 阅读全文

摘要： 好方法！/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:TreeNode *p,*q;TreeNode *prev; void recoverTree(TreeNode *root) { p=q=prev=NULL;... 阅读全文

摘要： 大整数乘法注意使用额外的空间会超时。class Solution {public: string multiply(string num1, string num2) { reverse(num1.begin(),num1.end()); reverse(num2.begin(),num2.end()); int l1=num1.size(); int l2=num2.size(); string v(l1+l2,'0'); int s; int multi; int c... 阅读全文