SYSUprophet

void MergeSortCore(int* data, int first, int last);void RingShift(int* data, int begin, int mid, int end);void MergeSort(int* data, int length){ if(data == NULL || length <= 0) return; MergeSort

//回溯算法int FindTheNumber(){ int solution[10]; memset(solution, 0, 10*sizeof(int)); bool used[10]; memset(used,false,10*sizeof(bool)); int num = 0; int k = 1; while(k >= 1) { if(solution[k]

struct ListNode { int val; ListNode *next; ListNode(int x = 0) : val(x), next(NULL) {}};void QuickSortCore(ListNode* pBegin, ListNode* pEnd);ListNode* partition(ListNode* pBegin, ListNode* pEnd)

void QuickSortCore(int* data, int first, int last);int partition(int* data, int first, int last);void QuickSort(int* data, int length){ if(data == NULL || length <= 0) return; QuickSortCore(data,

ListNode* MergeSort(ListNode* head) { if(head == NULL || head->next == NULL) return head; ListNode *head1 = head, *head2 = head; while(head2->next != NULL && head2->next->next != NULL) {

void QuickSortCore(int* data, int first, int last);int partition(int* data, int first, int last);void QuickSort(int* data, int length){ if(data == NULL || length <= 0) return; QuickSortCore(data,

void MergeSort(int* data, int length){ if(data == NULL || length <= 0) return; int *copy = new int[length]; int* arr[2] = {data, copy}; int cur = 0; //steps为步长，将arr[cur]分组，每组steps个，然后两两merge到a

//data[begin,mid)和data[mid,end)两部分交换位置 void RingShift(int* data, int begin, int mid, int end);void MergeSort(int* data, int length){ if(data == NULL || length <= 0) return; //steps为步长，将data[]分

void MergeSortCore(int* data, int* copy, int first, int last);void MergeSort(int* data, int length){ if(data == NULL || length <= 0) return; int* copy = new int[length]; for(int i = 0; i < lengt

/*** 对于非空串T，计算它的next数组**/void get_next(const char* T, int* next){ //输入检查 if(T == NULL || *T == '\0' || next == NULL) return; int i = 1, j = 0; next[0] = 0; int lenT = strlen(T); while(i < l