weixin_44130043的博客

因为公式写在网上不是很方便，所以就写在纸上拍照上转了

栈 package 算法; import java.util.Iterator; public class stack <Item>{ private class Node{ Item item; Node next; } private Node first; private int N = 0; public boolean isEmpty() {return ...

union-find package unionfind; import java.io.IOException; public class UnionFind { private int[] id; private int count; public UnionFind(int N) { count = N; for(int i=0;i<N;i++) id[i] =...

graph 队列，背包的实现在以前的记录中已实现 package 重复; public class Graph { private final int V; private int E; private bag<Integer>[] adj; public Graph(int v) { this.V = v; this.E = 0; adj = (bag<I...