摘要: #include<iostream>#include<vector>#include<queue>#include<string>#include<map>using namespace std;struct node{ int val; node * left,*right; node(int _ 阅读全文
posted @ 2016-07-02 23:13 simple_wxl 阅读(146) 评论(0) 推荐(0) 编辑
摘要: int getposition(int arr[],int left,int right) { int tmp=arr[left]; while(left<right) { while(left<right&&arr[right]>=tmp) right--; arr[left]=arr[right 阅读全文
posted @ 2016-07-02 17:04 simple_wxl 阅读(156) 评论(0) 推荐(0) 编辑