Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static void intersectionNode(SLL<Integer> lista1, SLL<Integer> lista2) {
- SLLNode<Integer> d1 = lista1.getFirst();
- SLLNode<Integer> d2 = lista2.getFirst();
- int diff = 0;
- int len1 = 0;
- int len2 = 0;
- while (d1 != null) {
- len1++;
- d1 = d1.succ;
- }
- while (d2 != null) {
- len2++;
- d2 = d2.succ;
- }
- d1 = lista1.getFirst();
- d2 = lista2.getFirst();
- if (len1 > len2) {
- diff = len1 - len2;
- for (int i=0; i<diff; i++) {
- d1 = d1.succ;
- }
- } else {
- diff = len2 - len1;
- for (int i=0; i<diff; i++) {
- d2 = d2.succ;
- }
- }
- while (d1 != null && d2 != null) {
- if (d1.element.equals(d2.element)) {
- System.out.println(d1.element);
- break;
- }
- d1 = d1.succ;
- d2 = d2.succ;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement