摘要：
#二分我好乱 1 class Solution { 2 public: 3 int searchInsert(int A[], int n, int target) { 4 // IMPORTANT: Please reset any member data you declared, as 5 // the same Solution instance will be reused for each test case. 6 if(n == 0) return n; 7 if(target A[n-1]) return... 阅读全文
摘要：
=看完别人的代码，就无限接近于认为自己是沙茶。大家的思路怎么这么简洁，以至于我能看懂，我估计我的代码别人都看不懂。 1 void flatten(TreeNode *root) { 2 // IMPORTANT: Please reset any member data you declared, as 3 // the same Solution instance will be reused for each test case. 4 TreeNode*tmp; 5 flattenpiece(root,tmp); 6 ... 阅读全文