Stone-Sea

摘要： #include<iostream> using namespace std; void solution(int a[], int aLength, int b[], int bLength, int c[], int cLength) { int res[3] = { a[0],b[0],c[0 阅读全文

摘要： #include<iostream> using namespace std; struct node { int data; struct node* next; }; node* solustion(node* head) { node* fast = head, * slow = head; 阅读全文

摘要： #include<iostream> using namespace std; struct node { int data; node* left; node* right; }; struct list { node* p; list* next; }; node * createTree() 阅读全文

摘要： #include<iostream> #include<vector> using namespace std; void reverse(int* a, int begin, int end) { for (int i = 0; i < ((end + begin) / 2); i++) { a[ 阅读全文

摘要： 1 #include<iostream> 2 using namespace std; 3 struct node { 4 int data; 5 node* next; 6 7 }; 8 int main() { 9 int d; 10 node* start=NULL, * end = NULL 阅读全文

摘要： void quicksort(int* num, int low, int high) { if (low < high) { int sign = num[low]; int i = low; int j = high; int mid = (low + high) / 2; while (i < 阅读全文