guguangzhu的专栏

以栈的形式展示递归流程package com.guge.test.recursion;/** * Created by guugangzhu on 2017/5/23. */public class StackTriangle {}class Params{ public int n; public int returnA

理解的还是不够透彻，明天再看看package com.guge.test.graph;/** * 有向带权树-最短路径 * Created by Guge on 2017/6/20. */public class GraphPath { private final int MAX_SIZE = 20; private final int INFINITY =

头疼

package com.guge.test;import java.util.Random;/** * Created by guugangzhu on 2017/6/1. */public class HashLink { public static void main(String[] args) { HashLink hashLink=new Has

package com.guge.test.heap;import java.util.Random;/** * Created by Guge on 2017/6/6. */public class HeapSort { private Node[] heapArray; private int maxSize; private int currentSiz

package com.guge.test.graph;/** * 有向图 * Created by Guge on 2017/6/12. */public class GraphD { private int maxVerts; private Vertex[] vertexList; private int[][] adjMat; private i

package com.guge.test.heap;import java.util.Random;/** * Created by guugangzhu on 2017/6/4. */public class Heap { private Node[] heapArray; private int maxSize; private int currentS

package com.guge.test.recursion;/** * Created by guugangzhu on 2017/5/17. */public class MergeSort { private int[] theArray; private int mElems; public MergeSort(int max){ th

package com.guge.test;/** * Created by guugangzhu on 2017/5/25. */public class Hash { private HashItem[] hashArray; private int arraySize; private HashItem nonItem; public Hash(

package com.guge.test.tree234;/** * Created by guugangzhu on 2017/5/12. */public class Tree234 { private Node root=new Node(); public int find(long key){ Node curNode=root;

package com.guge.test.tree;import java.util.TreeMap;/** * Created by guugangzhu on 2017/5/2. */public class BinaryTree { private Node root; private TreeMap treeMap; public Node find

package com.guge.test.graph;import java.util.Stack;/*** Created by Guge on 2017/6/8.*/public class Graph {private int maxVerts;private Vertex[] vertexList;private int[][] adjMat;