find job
wyl_zheyang
这个作者很懒,什么都没留下…
展开
-
链表逆序
class Solution { public: ListNode* printListFromTailToHead(struct ListNode* head) { ListNode *root = new ListNode(0),*p; while(head){ p = head->next; head->next = root->n原创 2015-04-16 10:58:04 · 396 阅读 · 0 评论 -
find job(快速排序)
/**** /* 快速排序 void q_sort(int l,int r){ if(l >= r)return; int left = l,rig = r,x = s[l]; while(left < rig){ while(left = x) rig --; if(left < rig) s[left++] = s[rig];原创 2015-04-21 21:37:15 · 460 阅读 · 0 评论