weixin_39420024的博客

1、最大子序列和（书2.4.3）//数组全负结果为0public int maxSubSum(int[] a) { int maxSum = 0; int thisSum = 0; for (int i = 0; i < a.length; i++) { thisSum += a[i]; if (thisSum > maxSum) { maxSum = th...

节选自JDK1.8的ArrayList:public class ArrayList<E> extends AbstractList<E> implements List<E>, RandomAccess, Cloneable, java.io.Serializable { // 默认初始容量，如果是new ArrayList<>()的话e...

Vector：默认容量为10，可以在构造时指定扩容大小，没有指定则默认两倍扩容，方法都是synchronized的public class Vector&lt;E&gt; extends AbstractList&lt;E&gt; implements List&lt;E&gt;, RandomAccess, Cloneable, java.io.Serializable { protecte...

1、插入排序public static void insertionSort(int[] a) {    for (int i = 1; i &lt; a.length; i++) { int j; int temp = a[i]; for (j = i; j &gt; 0 &amp;&amp; temp &lt; a[j - 1]; j--) { a[j] = a[j - 1...

1、拓扑排序void topsort() throws CycleFoundException{ Queue&lt;Vertex&gt; q = new Queue&lt;&gt;(); // 序号 int counter = 0; for each Vertex v: if(v.indegree == 0) q.add(v); while(!q.isEmpty()) { ...

1、HashMap节选public class HashMap&lt;K, V&gt; extends AbstractMap&lt;K, V&gt; implements Map&lt;K, V&gt;, Cloneable, Serializable { // 默认容量，new时为0，put()时调用putval()，putval()调用resize()table才不为null // 大...

1、TreeMappublic class TreeMap&lt;K, V&gt; extends AbstractMap&lt;K, V&gt; implements NavigableMap&lt;K, V&gt;, Cloneable, java.io.Serializable { private final Comparator&lt;? super K&gt; comparator;...

static class Entry&lt;K, V&gt; extends HashMap.Node&lt;K, V&gt; { //增加了节点作为链表的before和after域 Entry&lt;K, V&gt; before, after; Entry(int hash, K key, V value, Node&lt;K, V&gt; next) { super(hash...