weixin_38679101的博客

https://juejin.im/post/5a29d52cf265da43333e4da7http://hawstein.com/2013/03/26/dp-novice-to-advanced/

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,...

//直接插入排序算法void InsertSort(int a[],int n) { for (int i = 1; i < n; i++) { if (a[i] < a[i - 1]) { int j = i - 1; int tmp = a[i]; while (tmp < a[j]) { a[j + 1] = a[j]; j--;...

//寻找链表的环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...

void Merge(int arr[],const int left,const int right,const int middle){ int temp[right-left+1]; int i = left; int j = middle + 1; int k = 0; int m = 0; while(i <= middle &a...

void BubbleSort(vector<int> &arr){ if(arr.size() == 0) return; for(int i = 0; i < arr.size();i++) for(int j = 0;j < arr.size()-i;j++) { if...

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