BINGXIHEART的博客

链表队列public class QueueBasedOnLinkedList { public static class Node { int data; Node next; public Node(int data, Node next) { this.data = data; this.next = next; } public int getData(

链表栈public class StackBasedOnLinkedList { private Node top = null; private static class Node { int data; Node next; public Node(int data, Node next) { this.data = data; this.next = next; .

原地排序算法：就是特指空间复杂度是O(1)的排序算法。稳定性：这个概念是说，如果待排序的序列中存在值相等的元素，经过排序之后，相等元素之间原有的先后顺序不变。稳定排序算法：排序之后值相等的元素的先后顺序不发生改变不稳定排序算法：排序之后值相等的元素的先后顺序发生了改变...