摘要：class Solution {public: vector> result; vector> levelOrderBottom(TreeNode* root) { vector thisleveldata; vector topleveldata; if(root == N... 阅读全文

摘要：class Solution {public: int rowlen; int collen; bool searchMatrix(vector>& matrix, int target) { rowlen = matrix[0].size(); ... 阅读全文

摘要：class Solution {public: int findKthLargest(vector& nums, int k) { int index=0; int backindex = nums.size()-1, forindex = 0; while(1)... 阅读全文