weixin_38679101的博客

int GetMaxValue(vector<vector<int> > &arr) { if(arr.size() == 0||arr[0].size() == 0) return 0; int m = arr.size(); int n = arr[0].size(); vector<vector<int> > dp(m,...

//寻找链表的环 ListNode* FindLink(ListNode* head) { if(head == nullptr) return nullptr; ListNode* slow = head->next; if(slow == nullptr) return nullptr; ListNode* fast = ...

//重建二叉树 //例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。 struct TreeNode{ int val; TreeNode* left; TreeNode* right; }; //重建二叉树 TreeNode* ReConstructTree(vector<int>...

struct TreeNode{ int val; struct TreeNode* left; struct TreeNode* right; TreeNode(int x): val(x), left(NULL),right(NULL){ } }; vector<int> CenShowTree(TreeNode* pRo...

#include <iostream> #include <vector> #include <queue> using namespace std; //循环 int BinarySearch(vector<int> arr,int left,int right,int target) { while(left <= right)...

bool isNumeric(char* string) { if(string == NULL) return false; if(*string == '+'||*string == '-') string++; if(*string == '\0') return false; int dot = 0,num ...

bool hasPath(char* matrix, int rows, int cols,char* str ) { if(str == NULL||rows<=0||cols<=0) return false; bool *isOK = new bool[rows*cols](); for(int i = 0;i < rows;i++...