单链表实现大数相加

Author: javon

java-study/src/main/java/general/node/circle/CircleLength.java

@@ -26,14 +26,14 @@ public <E> int getLengthOfCircle(Node<E> head){
 
 		Node<E> slow = firstMeetingNode;
 		Node<E> fast = firstMeetingNode;
+		
 		for(int i = 1; ; i++){
 			slow = slow.getNext();
 			fast = fast.getNext().getNext();
 			if(slow == fast){
 				return i;
 			}
 		}
-		
 	}
 
 

java-study/src/main/java/general/node/other/BigNumberAdd.java

@@ -0,0 +1,68 @@
+package general.node.other;
+
+import general.node.Node;
+
+/**
+ * 两个使用链表表示的大数相加
+ * @author javon
+ *
+ */
+public class BigNumberAdd {
+
+	static Node<Integer> NODE_ZERO = new Node<Integer>(0,null);
+	
+	public Node<Integer> add(Node<Integer> head1, Node<Integer> head2){
+		int carry = 0;
+		int tmp = 0;
+		Node<Integer> result = new Node<Integer>();
+		Node<Integer> pre = new Node<Integer>();
+		if(head1 == null && head2 == null){
+			return null;
+		}else if(head1 == null){
+			return head2;
+		}else if(head2 == null){
+			return head1;
+		}else{
+			tmp = head1.getValue() + head2.getValue();
+		}
+		if(tmp >= 10){
+			tmp -= 10;
+			carry = 1;
+		}
+		pre.setValue(tmp);
+		
+		result = pre;
+		
+		while(true){
+			Node<Integer> next = new Node<Integer>();
+			if(head1.getNext() == null && head2.getNext() == null){
+				if(carry == 1){
+					next.setValue(carry);
+					pre.setNext(next);
+				}
+				return result;
+			}else if(head1.getNext() == null){
+				head2 = head2.getNext();
+				tmp = head2.getValue() + carry;
+			}else if(head2.getNext() == null){
+				head1 = head1.getNext();
+				tmp = head1.getValue() + carry;
+			}else{
+				head2 = head2.getNext();
+				head1 = head1.getNext();
+				tmp = head1.getValue() + head2.getValue() + carry;
+			}
+			if(tmp >= 10){
+				tmp -= 10;
+				carry = 1;
+			}else{
+				carry = 0;
+			}
+			next.setValue(tmp);
+			pre.setNext(next);
+			pre = next;
+			
+		}
+	}
+	
+}

java-study/src/test/java/general/node/other/BigNumberAddTest.java

@@ -0,0 +1,58 @@
+package general.node.other;
+
+import static org.junit.Assert.fail;
+
+import java.util.Random;
+
+import org.junit.Before;
+import org.junit.Test;
+
+import general.node.Node;
+
+public class BigNumberAddTest {
+	
+	private Node<Integer> head1 = new Node<Integer>(9, null); 
+	private Node<Integer> head2 = new Node<Integer>(8, null); 
+	
+	@Before
+	public void init(){
+		
+		Node<Integer> head1 = this.head1;
+		Node<Integer> head2 = this.head2;
+		Random random = new Random();
+		for (int i = 0; i < 600; i++) {
+			Node<Integer> next1 = new Node<Integer>(random.nextInt(9),null);
+			head1.setNext(next1);
+			head1 = next1;
+		}
+		
+		for (int i = 0; i < 700; i++) {
+			Node<Integer> next2 = new Node<Integer>(random.nextInt(9),null);
+			head2.setNext(next2);
+			head2 = next2;
+		}
+	}
+
+	@Test
+	public void test() {
+		printNode(head1);
+		System.out.println("+");
+		printNode(head2);
+		System.out.println("=");
+		BigNumberAdd bigNumberAdd = new BigNumberAdd();
+		Node<Integer> node = bigNumberAdd.add(head1, head2);
+		printNode(node);
+	}
+	
+	
+	private void printNode(Node<Integer> head){
+		System.out.print(head.getValue());
+		while(head.getNext() != null){
+			head = head.getNext();
+			System.out.print(head.getValue());
+		}
+		System.out.println();
+	}
+	
+
+}

java-study/src/test/java/general/node/other/DeleteNode.java

@@ -0,0 +1,5 @@
+package general.node.other;
+
+public class DeleteNode {
+
+}

java-study/src/test/java/general/node/other/MergeNodeList.java

@@ -0,0 +1,27 @@
+package general.node.other;
+
+import general.node.Node;
+
+/**
+ * 有序链表合并
+ * 链表为升序
+ * @author javon
+ *
+ */
+public class MergeNodeList {
+	
+	public <E> Node<E> merge(Node<E> head1, Node<E> head2){
+		if(head1 == null && head2 == null){
+			return null;
+		}else if(head1 == null){
+			return head2;
+		}else if(head2 == null){
+			return head1;
+		}else{
+			return null;
+		}
+		
+	}
+	
+
+}

java-study/src/test/java/general/node/other/ReverseNodeList.java

@@ -0,0 +1,5 @@
+package general.node.other;
+
+public class ReverseNodeList {
+
+}

java-study/src/test/java/general/node/other/ReversePrint.java

@@ -0,0 +1,5 @@
+package general.node.other;
+
+public class ReversePrint {
+
+}