数据结构
curiousby
这个作者很懒,什么都没留下…
展开
-
hashMap 根据键 排序
ort java.util.Map; import java.util.Map.Entry; import java.util.Set; /** * @author baoyou E-mail:[email protected] * @version 创建时间:2015年9月7日 上午10:29:36 * des: */ public class SortMap { static Map<String,String> target = ne原创 2015-09-08 23:26:49 · 122 阅读 · 0 评论 -
java 二叉树遍历
s BinaryTree { // 定义二叉树的操作类 static int[] arr= {0,1,2,3,4,5,6,7,8,9}; private static class Node { Node left; Node right; int data; Node(int data){ this.left = null; this.right = null; this.data =原创 2015-09-08 23:25:49 · 88 阅读 · 0 评论 -
LinkedList 仿源码
public static class Node<E> { public E obj; public Node<E> prev = null; public Node<E> next = null; Node(Node<E> prev, E element, Node<E> next) { this.obj = element;原创 2015-09-10 12:21:47 · 60 阅读 · 0 评论 -
stack 栈
int data; Node pre; public Node(int data) { this.data = data; } } transient Node head; transient Node current; public void push(int data) { if (head == null) {原创 2015-09-10 14:32:51 · 75 阅读 · 0 评论 -
Queue 队列
int data; Node next; public Node(int data) { this.data = data; } } transient Node head; transient Node current; public void push(int data) { if (head == null) { he2015-09-10 14:32:19 · 71 阅读 · 0 评论 -
HashMap 原理分析
原创 2015-09-21 11:32:33 · 60 阅读 · 0 评论 -
java 最小栈
ck implements IMinMaxStack<Integer> { private static int maxLength = 5; private static int [] data= new int[maxLength]; private static int [] mins= new int[maxLength]; private static int [] maxs= new int[maxLength]; private static2017-10-31 21:38:07 · 116 阅读 · 0 评论