Commiting Linked List

Author: balarajv

CodePractice/bin/generealRecursion/CombinationsOfAString.class

@@ -0,0 +1,13 @@
+package generealRecursion;
+
+public class CombinationsOfAString {
+
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}

CodePractice/bin/generealRecursion/IsArrayInSortedRec.class

@@ -0,0 +1,18 @@
+package generealRecursion;
+
+public class IsArrayInSortedRec {
+
+	public static boolean isSorted(int[] arr, int n){
+		if(n == 0){
+			return true;
+		}else{
+			return arr[n] > arr[n-1] ? isSorted(arr, n-1): false;
+		}
+	}
+	public static void main(String[] args) {
+		int [] a = {3,5,4,1,2};
+		int []b = {1,2,3,4,5};
+		System.out.println(isSorted(b, b.length -1));
+	}
+
+}

CodePractice/bin/generealRecursion/PermutaionOfAString.class

@@ -0,0 +1,13 @@
+package generealRecursion;
+
+public class PermutaionOfAString {
+
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}

CodePractice/bin/generealRecursion/TowerOfHanoi.class

@@ -0,0 +1,21 @@
+package generealRecursion;
+
+public class TowerOfHanoi {
+
+	public static void solve(int n, String source, String auxillary, String destination){
+		if(n == 1){
+			System.out.println(source +" to "+ destination);
+		}else{
+			solve(n-1, source, destination, auxillary);
+			System.out.println(Integer.toString(n)+" "+source +" to "+ destination);
+			solve(n-1, auxillary, source, destination);
+		}
+		
+	} 
+	
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		solve(4, "S","B","C");
+	}
+
+}

CodePractice/bin/myLinkedList/CircularLinkedList.class

@@ -0,0 +1,86 @@
+package myLinkedList;
+
+public class CircularLinkedList {
+	Node head = null;
+	int length = 0;
+	
+	public CircularLinkedList(){
+		head = null;
+	}
+	public CircularLinkedList(Object data){
+		head.data = data;
+		head.next = head;
+		length++;
+	}
+	
+	public int countNodes(){
+		Node curNode = head;
+		if (head == null) return 0;
+		int count = 1;
+		while(curNode.next != head){
+			count++;
+			curNode = curNode.next;
+		}
+		return count;
+	}
+	
+	public String toString(){
+		StringBuffer strBuf = new StringBuffer("");
+		Node curNode = head;
+		strBuf.append(head.data.toString());
+		while(curNode.next != head){
+			curNode = curNode.next;
+			strBuf.append(curNode.data.toString()+" ");
+		}
+		strBuf.append(curNode.data.toString());
+		return strBuf.toString();
+	}
+	
+	public void insertAtTheStart(Object data){
+		Node newNode = new Node(data);
+		newNode.next = head;
+		Node curNode = head;
+		while(curNode.next != head){
+			curNode = curNode.next;
+		}
+		curNode.next = newNode;
+		head = newNode;
+	}
+	
+	public void insertAtTheEnd(Object data){
+		 Node newNode = new Node(data);
+		 newNode.next = head;
+		 Node curNode =  head;
+		 while(curNode.next != head){
+			 curNode = curNode.next;
+		 }
+		 curNode.next = newNode;
+	}
+	
+	public void deleteFront(){
+		if(head == null) return;
+		if(head.next == head){
+			head = null;
+			return;
+		}
+		Node curNode = head.next;
+		while(curNode.next != head){
+			curNode = curNode.next;
+		}
+		curNode.next = head.next;
+		head = head.next;
+	}
+	
+	public void deleteLast(){
+		if(head == null) return;
+		if(head.next == head){
+			head = null;
+			return;
+		}
+		Node curNode = head;
+		while(curNode.next.next != head){
+			curNode = curNode.next;
+		}
+		curNode.next = head;
+	}
+}

CodePractice/bin/myLinkedList/DDLNode.class

@@ -0,0 +1,38 @@
+package myLinkedList;
+
+public class DDLNode {
+	Object data;
+	DDLNode prev;
+	DDLNode next;
+	public DDLNode(Object data){
+		this.data =  data;
+		next = null;
+		prev = null;
+	}
+	public DDLNode(Object data, DDLNode prev, DDLNode next){
+		this.data = data;
+		this.prev = prev;
+		this.next = next;
+	}
+	public Object getData(){
+		return this.data;
+	}
+	public void setData(Object data){
+		this.data = data;
+	}
+	public DDLNode getPrev(){
+		return this.prev;
+	}
+	public void setPrev(DDLNode node){
+		this.prev = node;
+	}
+	public DDLNode getNext(){
+		return this.next;
+	}
+	public void setNext(DDLNode node){
+		this.next = node;
+	}
+	public String toString(){
+		return this.data.toString();
+	}
+}