GeorgesGuo的博客

public class Finder { public int findKth(int[] a, int n, int K) { return findKth(a, 0, n-1, K); } public int findKth(int[] a, int low, int high, int k) { int part = partation(a, low, high);...

//队列实现栈class MyStack { private Queue<Integer> queue1; private Queue<Integer> queue2; private int size; /** Initialize your data structure here. */ public MyStack() {...