摘要:
package com.zb.swdata.core;public class Test { public static class Node{ public Node nextnode; private Integer num; public Node get(){ return nextnode 阅读全文
摘要:
思路1: 将数字第一个拿出来,然后从右边往左边找第一个比基准值小的挪到左边,同理挪动左边的 def q_sort(arr, left, right): if left >= right: return arr temp = arr[left] i = left j = right while(i < 阅读全文