mindSucker

摘要： JDK1.0 1.1 1996年Java有了第一个正式版本的运行环境。代表技术包括：Java虚拟机，Applet，AWT；1997年，Jar格式，JDBC，JavaBeans，RMI诞生； JDK1.2 1998年，SUN将Java技术体系拆分成三个方向，桌面引用开发J2SE，企业级开发J2EE，手 阅读全文

摘要： //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" /** * 本质上是遍历每个元素，和数组前部的有序部分进行一一比较，找到合适的位置，进行插入 * 所以这里有两部分逻 阅读全文