- 博客(21)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 算法之二项堆
package com.eshore.sweetop.exdataframe;public class BinomialHeap { private BinomialNode head; public BinomialNode getHead() { return head; } private void setHead(BinomialNode head)
2008-10-31 18:41:00
1894
4
原创 算法之B树
package com.eshore.sweetop.exdataframe;public class BTree { private BNode root; private int min; public BTree() { BNode node = new BNode(); node.setLeaf(true); node.setCo
2008-10-31 13:44:00
1564
原创 算法之带权调度问题（有个人新创复杂度n算法）
package com.eshore.sweetop.cupidity;import java.util.ArrayList;import java.util.List;public class Quest { Qt[] qt = { new Qt(4, 70), new Qt(2, 60), new Qt(4, 50), new Qt(3, 40), new Qt(1
2008-10-29 19:03:00
1510
原创 算法之赫夫曼编码
package com.eshore.sweetop.cupidity;import java.util.ArrayList;public class Huffman { private char[] c = { a, b, c, d, e, f }; private int[] f={45,13,12,16,9,5}; class Node{
2008-10-28 15:18:00
1568
原创 算法之活动选择问题
//递归版本 public void recursive(){ activitySelector(s,f,-1,a.length-1); } public void activitySelector(int[] s, int[] f, int i, int n) { int m = i + 1; while (m 1?0:
2008-10-28 11:30:00
1328
原创 算法之动态规划最优二叉树
package com.eshore.sweetop.dynamicprogramming;public class BestBinTree { //关键字节点,p[0]为构造数据// double[] p={0,0.15,0.10,0.05,0.10,0.20}; //虚拟节点// double[] q={0.05,0.10,0.05,0.05,0.05,0.10}; //
2008-10-27 19:27:00
3362
原创 算法之LCS
package com.eshore.sweetop.dynamicprogramming;public class LCS { public static void LCSLength(char[] x, char[] y) { int m = x.length; int n = y.length; int[][] c = new int[m +
2008-10-23 18:57:00
1282
原创 算法之矩阵链乘法问题
package com.eshore.sweetop.dynamicprogramming;public class MatrixChain { public static void order(int[] p) { int n = p.length - 1; int[][] m = new int[n][n]; int[][] s = new in
2008-10-23 16:27:00
1267
原创 算法之装配线问题
package com.eshore.sweetop.dynamicprogramming;//装配线问题public class Colonel { //1号装配线效率 int[] a1={7,9,3,4,8,4}; //2号装配线效率 int[] a2={8,5,6,4,5,7}; //1号到2号运输线 int[] t1={2,3,1,3,4};
2008-10-23 11:17:00
1436
原创 算法之动态顺序统计
package com.eshore.sweetop.dataframe;import com.eshore.sweetop.data.KeyData;import com.eshore.sweetop.data.Node;import com.eshore.sweetop.data.RBNode;public class RBTree { private RBNode root; p
2008-10-13 20:14:00
1400
原创 算法之红黑树
package com.eshore.sweetop.dataframe;import com.eshore.sweetop.data.KeyData;import com.eshore.sweetop.data.Node;import com.eshore.sweetop.data.RBNode;public class RBTree { private RBNode root; p
2008-10-10 13:57:00
1394
1
原创 算法之二叉查找树
package com.eshore.sweetop.dataframe;import java.util.Random;import com.eshore.sweetop.data.KeyData;import com.eshore.sweetop.data.Node;/* * bintree */public class Bintree { private Node root;
2008-10-09 11:36:00
1184
原创 算法之双重散列
package com.eshore.sweetop.dataframe;import java.math.BigInteger;import com.eshore.sweetop.data.KeyData;public class DoubleOpenHash extends OpenHash { public DoubleOpenHash(int size) {// super
2008-10-08 19:42:00
2020
原创 算法之线性探查
package com.eshore.sweetop.dataframe;import com.eshore.sweetop.data.KeyData;/* * linear probing * Note: secondary chustering */public class LineOpenHash extends OpenHash { public LineOpenHash(int s
2008-10-08 19:41:00
1290
原创 算法-----二次探查
package com.eshore.sweetop.dataframe;import java.math.BigInteger;import com.eshore.sweetop.data.KeyData;public class DoubleOpenHash extends OpenHash { public DoubleOpenHash(int size) {// super
2008-10-08 19:41:00
1425
原创 算法-----开放寻址法
packagecom.eshore.sweetop.dataframe;importcom.eshore.sweetop.data.KeyData;/**开放寻址法解决碰撞问题*/publicclassOpenHash{protectedKeyData[]table;publicOpenHash(intsize){table=newKeyD
2008-10-08 19:39:00
1980
原创 算法----乘法连接法散列表
package com.eshore.sweetop.dataframe;import java.util.LinkedList;import com.eshore.sweetop.data.KeyData;public class MultiChainedHash { LinkedList[] table = new LinkedList[(int)Math.pow(2, 6)];
2008-10-08 14:55:00
1375
原创 算法-----链接法散列表
package com.eshore.sweetop.dataframe;import java.util.LinkedList;import com.eshore.sweetop.data.KeyData;public class ChainedHash { LinkedList[] table = new LinkedList[10]; public void insert(KeyData o
2008-10-07 16:39:00
1363
原创 算法-----链表
package com.eshore.sweetop.dataframe;public class MyLinkedList { private Element head; public void insert(int x){ Element e=new Element(x); e.next=head; if(head!=null){
2008-10-07 16:36:00
1014
原创 算法-----队列
package com.eshore.sweetop.dataframe;public class Quene { private int head=-1; private int tail=0; private int[] q; public Quene(){ q=new int[100]; } public Quene(int
2008-10-07 16:35:00
1027
原创 算法-----栈
package com.eshore.sweetop.dataframe;public class Stack { private int top=-1; private int[] s; public Stack(){ s=new int[100]; } public Stack(int n){ s=new int[n];
2008-10-07 16:33:00
984
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人