ccqq0507的博客

//#include <bits/stdc++.h>#include<iostream>#include<stack>using namespace std;#define M (INT_MAX)#define PRINT_ARRAY(a,n) do{for(int i = 0; i < n; i++) cout<<a[i]<<"|"; cout<<endl;}while(0)/***************

void heapInsert(int curArr[], int index){ while (curArr[index]>curArr[(index-1)/2]) { swap(curArr[index], curArr[(index - 1) / 2]); index = (index - 1) / 2; }}void heapify(int curArr[], int heapSize){ int rootIndex =

int partion(int curArr[],int lIndex,int rIndex){ int partIndex = rIndex; int moreIndex = rIndex - 1; int lessIndex = lIndex; while (moreIndex != lessIndex) { if (curArr[lessIndex] > curArr[partIndex]) { swap(curArr[

deque<int> merge(deque<int>leftVec, deque<int>rightVec) { deque<int> ret; //reverse(leftVec.begin(), leftVec.end()); //reverse(rightVec.begin(), rightVec.end()); while (leftVec.size()>0&&rightVec.size()&gt

// fowlup.cpp -- unique_ptr not a good choice#include <iostream>#include <string>#include <stack>#include<vector>#include<string>#include <algorithm>using namespace std;struct TreeNode { int val; TreeNo

void traversal(TreeNode* cur, vector<int>& path){ path.push_back(cur->val); if (cur->left == nullptr && cur->right == nullptr) { cout << "path::::"; for (auto it : path) { cout <&l

#pragma once#include <iostream>#include <vector>#include <queue>using namespace std;class AStar{public: struct AStarPathPoint { AStarPathPoint* father; int x, y, gval, hval, fval; AStarPathPoint(pair<int, int> point, p

void CengOrder(TreeNode* root,vector<vector<int>>& res) { if (root == nullptr) return; queue<TreeNode*> q; q.push(root); while (!q.empty()) { int cursize = q.size(); res.push_back(vector<int>(

// fowlup.cpp -- unique_ptr not a good choice#include <iostream>#include <string>//#include <memory>#include<vector>#include<string>using namespace std;struct TreeNode { int val; TreeNode* left; TreeNode* r