摘要：Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal number and 110 is a 阅读全文

摘要：//1. char 转 int char a = '3'; int intA = a - '0'; //2.string 转 int int num = atoi(input.data()); //3.num 转 string string resultString = to_string(num) 阅读全文

摘要：A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. Input Specification: Each inp 阅读全文

摘要：原题目： As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by so 阅读全文

摘要：#include "DFS.h" #include <list> #include <stack> using namespace std; DFS::DFS(int vertexCount) { this->v = vertexCount; this->adj = new list<int>[v] 阅读全文

摘要：#include <queue> #include <list> #include "BFS.h" using namespace std; BFS::BFS(int vertexCount){ this->v = vertexCount; this->adj = new list<int>[v]; 阅读全文

摘要：class ShellSort { public: void sort(int * arr, int size); }; #include "ShellSort.h" #include <iostream> void ShellSort::sort(int *arr, int size) { int 阅读全文

摘要：class QuickSort { public: void sort(int * arr, int size); private: int partition(int * arr, int start, int end); void quickSort(int *arr, int start, i 阅读全文

摘要：class MergeSort { public: void sort(int * arr, int size); private: void arrCopy(int *sourceArr, int *targetArr, int size); void divideSort(int *arr, i 阅读全文

摘要：class InsertionSort { public: void sort(int * arr, int size); }; #include "InsertionSort.h" /** * 本质上是遍历每个元素，和数组前部的有序部分进行一一比较，找到合适的位置，进行插入 * 所以这里有两部分逻 阅读全文

摘要：class BubbleSort { public: void sort(int * arr, int size); }; #include "BubbleSort.h" /** * 冒泡排序，意思是从头开始，拿 j 和 j+1 元素 进行比较，如果前面的元素大于后面的元素，那么就进行交换，就像冒泡 阅读全文

摘要：Mingw-w64官网可以下载到安装程序，进行下载安装，但是速度极度的缓慢，所以不太建议； sourseForge，可以去SourceForge搜索mingW，找到 MinGW-w64 - for 32 and 64 bit Windows，点进去，看files，选择对应MinGW-W64版本，进行 阅读全文