L_Aster的专栏

时间复杂度O(n)#include <stdio.h> int SearchKth(int a[],int L,int R,int k) { int i=L,j=R; int pivot=a[i]; while(i<j) { while(i<j&&a[j]>=pivot) --j; a[i]=a[j]; while(i<

34. Search for a Rangeint findLeft(int *nums,int s,int e,int target) { int i=s,j=e,m=0,idx=-1; while(i<=j) { m=(i+j)/2; if(nums[m]<target) i=m+1; else j=m-1;

19. Remove Nth Node From End of Liststruct ListNode* removeNthFromEnd(struct ListNode* head, int n) { struct ListNode *L=(struct ListNode *)malloc(sizeof(struct ListNode)); L->next=head; st

21. Merge Two Sorted Lists 注：代码来自leetcodestruct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) { if(l1==NULL) return l2; if(l2==NULL) return l1; if(l1->val<l2->val)

109. Convert Sorted List to Binary Search Treestruct TreeNode* constr(struct ListNode* head,struct ListNode* tail) { if(head==tail) return NULL; struct ListNode *mid=head,*temp=head; while(

目录 1. 查找一个数组中第k小的数 2. 移去链表倒数第n个节点-LeetCode 3. 合并两个有序链表，递归实现-LeetCode 4. 合并k个有序链表-LeetCode 5. 将有序单链表转化为平衡二叉树

23. Merge k Sorted Listsstruct ListNode* mergeTwoLists(struct ListNode *l1,struct ListNode *l2) { if(l1==NULL) return l2; if(l2==NULL) return l1; if(l1->val<l2->val) { l1->next=

分治法：#include <iostream> #include <vector> using namespace std; int A[]={-2,1,-3,4,-1,2,1,-5,4}; int CrossSubArray(int A[],int low,int high,int mid) { int left_max=0x80000000; int right_max=0x80