commit

Author: 1367356

.metadata/.plugins/org.eclipse.core.resources/.history/14/f009629af9a30017131c82ab4c885138

@@ -0,0 +1,19 @@
+package dynamicProgramming;
+
+public class TestDynamicProgramming {
+	/**
+	 * 测试动态规划的java类
+	 * int[] p  长度对应的价格数组
+	 * n   钢条长度，这个长度和真正的类中的长度不相同，因为java数组的角标从0开始等。
+	 * @param args
+	 */
+			public static void main(String[] args) {
+				int[] p={0,1,5,8,9,10,17,17,20,24,30};
+				int n=9;  //输入的n，实际为n-1 ;  因为java角标是从0开始的
+				DynamicProgramming dp=new DynamicProgramming();
+//				int maxProce=dp.memoizedCutRod(p, n+1);
+//				int maxPrice=dp.bottomUpCutRod(p, n+2);   //两个for循环嵌套
+//				System.out.println(maxPrice);
+				dp.printCutRodSolution(p, n+2);
+			}
+}

.metadata/.plugins/org.eclipse.core.resources/.history/5c/e04a34eefca30017131c82ab4c885138

@@ -0,0 +1,109 @@
+package redBlackTree;
+
+public class RedBlackTree <T extends Comparable<T>>{
+		public static final boolean RED=true;
+		public static final boolean BLACK=false;
+	    public RBTreeNode NIL;
+	    public RBTreeNode root;
+		public class RBTreeNode<T extends Comparable<T>>{
+			RBTreeNode leftChild;
+			RBTreeNode rightChild;
+			RBTreeNode parent;
+			T key;
+			boolean color;
+		}
+		public  void print() {
+			// TODO Auto-generated method stub
+			System.out.println(root.leftChild.key);
+			System.out.println(root.rightChild.key);
+		}
+		public void insert(T key){
+			RBTreeNode newRBTreeNode=new RBTreeNode<>(); 
+			newRBTreeNode.key=key;
+			RBTreeNode y=NIL;
+			RBTreeNode x=root;
+			while(x!=NIL){
+				y=x;
+				if(newRBTreeNode.key.compareTo(x.key)<0){
+					x=x.leftChild;
+				}else{
+					x=x.rightChild;
+				}
+			}
+			newRBTreeNode.parent=y;
+			if(y==NIL){
+				root=newRBTreeNode;
+			}else if(newRBTreeNode.key.compareTo(y.key)<0){
+				y.leftChild=newRBTreeNode;
+			}else{
+				y.rightChild=newRBTreeNode;
+			}
+			newRBTreeNode.leftChild=NIL;
+			newRBTreeNode.rightChild=NIL;
+			newRBTreeNode.color=RED;
+			insertFixUp(newRBTreeNode);
+		}
+		private void insertFixUp(RBTreeNode newRBTreeNode) {
+			// TODO Auto-generated method stub
+			if(newRBTreeNode.parent!=null){
+				while(newRBTreeNode.parent.color==RED){
+					if(newRBTreeNode.parent==newRBTreeNode.parent.parent.leftChild){
+							RBTreeNode y=newRBTreeNode.parent.parent.rightChild;
+							if(y.color==RED){
+								newRBTreeNode.parent.color=BLACK;
+								y.color=BLACK;
+								newRBTreeNode.parent.parent.color=RED;
+								newRBTreeNode=newRBTreeNode.parent.parent;
+							}else if(newRBTreeNode==newRBTreeNode.parent.rightChild){
+								newRBTreeNode=newRBTreeNode.parent;
+								leftRotate(newRBTreeNode);
+							}else{
+								newRBTreeNode.parent.color=BLACK;
+								newRBTreeNode.parent.parent.color=RED;
+								rightRotate(newRBTreeNode);
+							}
+					}else{
+				            //same as then clause with "right" and "left" changted		
+					}
+				}
+			}
+
+			root.color=BLACK;
+		}
+		private void rightRotate(RBTreeNode newRBTreeNode) {
+			// TODO Auto-generated method stub
+			RBTreeNode x=newRBTreeNode.leftChild;
+			newRBTreeNode.leftChild=x.rightChild;
+			if(x.rightChild!=NIL){
+				x.rightChild.parent=newRBTreeNode;
+			}
+			x.parent=newRBTreeNode.parent;
+			if(newRBTreeNode==NIL){
+				root=x;
+			}else if(newRBTreeNode==newRBTreeNode.parent.leftChild){
+				newRBTreeNode.parent.leftChild=x;
+			}else{
+				newRBTreeNode.parent.rightChild=x;
+			}
+			x.rightChild=newRBTreeNode;
+			newRBTreeNode.parent=x;
+		}
+		private void leftRotate(RBTreeNode newRBTreeNode) {
+			// TODO Auto-generated method stub
+			RBTreeNode  y=newRBTreeNode.rightChild;
+			newRBTreeNode.rightChild=y.leftChild;
+			if(y.leftChild!=null){
+				y.leftChild.parent=newRBTreeNode;
+			}
+			y.parent=newRBTreeNode.parent;
+			if(newRBTreeNode.parent==NIL){
+				root=y;
+			}else if(newRBTreeNode==newRBTreeNode.parent.leftChild){
+				newRBTreeNode.parent.leftChild=y;
+			}else{
+				newRBTreeNode.parent.rightChild=y;
+			}
+			y.leftChild=newRBTreeNode;
+			newRBTreeNode.parent=y;
+		}
+}

.metadata/.plugins/org.eclipse.core.resources/.history/8f/50b09885f9a30017131c82ab4c885138

@@ -0,0 +1,13 @@
+package dynamicProgramming;
+
+public class TestDynamicProgramming {
+			public static void main(String[] args) {
+				int[] p={0,1,5,8,9,10,17,17,20,24,30};
+				int n=9;  //输入的n，实际为n-1 ;  因为java角标是从0开始的
+				DynamicProgramming dp=new DynamicProgramming();
+//				int maxProce=dp.memoizedCutRod(p, n+1);
+//				int maxPrice=dp.bottomUpCutRod(p, n+2);   //两个for循环嵌套
+//				System.out.println(maxPrice);
+				dp.printCutRodSolution(p, n+2);
+			}
+}