Finds the intersection of two sorted lists without duplicates

IntersectionTwoSortedLists.java

class IntersectionTwoSortedLists {
   public static void main(String[] args) {
      int[] a1 = { 2, 3, 3, 4, 6, 6, 8 };
      int[] a2 = { 3, 3, 6, 7, 9 };

      for (int c1 = 0, c2 = 0; c1 < a1.length && c2 < a2.length; ) {
         if (a1[c1] < a2[c2]) c1++;
         else if (a1[c1] > a2[c2]) c2++;
         else {
            if (c1 != a1.length - 1 && a1[c1] == a1[c1 + 1])
               c1++;
            else if (c2 != a2.length - 1 && a2[c2] == a2[c2 + 1])
               c2++;
            else {
               System.out.print(a1[c1] + " ");
               c1++;
               c2++;
            }
         }
      }
      System.out.println();
   }
}
// prints out 3 6