whiteParachute的博客

运行时间：13ms占用内存：1496kclass Solution {public: bool Find(int target, vector<vector<int> > array) { int rows = 0; int cols = array[0].size() - 1; while(rows < ar...

运行时间：6ms占用内存：608kclass Solution {public: void replaceSpace(char *str,int length) { for(int i = 0; i < length - 1; i++) { if(str[i] == ' ') { ...

运行时间：7ms占用内存：476k/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };...

运行时间：3ms占用内存：608k/*** struct ListNode {* int val;* struct ListNode *next;* ListNode(int x) :* val(x), next(NULL) {* }* };*/class Solution {public:...