public static List<Integer> intersectSortedArraysThree(int[] a, int[] b) {
		ArrayList<Integer> result = new ArrayList<Integer>();
		int i = 0;
		int j = 0;
		while (i < a.length && j < b.length) {
			if ((i == 0 || a[i] != a[i - 1]) && (a[i] == b[j])) {
				result.add(a[i]);
				i++;
				j++;
				continue;
			}
			if (a[i] < b[j]) {
				i++;
			}else {
				j++;
			}
		}
		return result;
	}