private void createDataforIntersection(out LinkedLists ll1, out LinkedLists ll2) { ll1 = new LinkedLists(); ll2 = new LinkedLists(); Node n1 = new Node("3"); Node n2 = new Node("6"); Node n3 = new Node("9"); Node n4 = new Node("15"); Node n5 = new Node("30"); Node n6 = new Node("10"); ll1.head = n1; n1.nextNode = n2; n2.nextNode = n3; n3.nextNode = n4; n4.nextNode = n5; ll2.head = n6; n6.nextNode = n4; }
private LinkedLists removeDuplicates(LinkedLists ll) { Node current = ll.head; Node runner = null; while (current != null) { runner = current; while (runner.nextNode != null) { if (runner.nextNode.value == current.value) { runner.nextNode = runner.nextNode.nextNode; } else { runner = runner.nextNode; } } current = current.nextNode; } return(ll); }