Krystian kwojcicki

layout

title

subtitle

date

author

header-img

comments

	Pair findPairUsingSorted(int[] numbers, int k){
	int first = 0;
	int last = numbers.length - 1;
	while(true){
	if(numbers[first] + numbers[last] < k){
	first++;
	} else if(numbers[first] + numbers[last] > k){
	last--;
	} else {
	return new Pair(numbers[first], numbers[last]);

	Pair findPairGivingSumUsingMap(int[] numbers, int k){
	Set<Integer> seen = new HashSet<Integer>();
	for(int i = 0; i < numbers.length; i++){
	if(seen.contains(k - numbers[i])){
	return new Pair(numbers[i], k - numbers[i]);
	}
	seen.add(numbers[i]);
	}

	return null;

	Pair findPairGivingSum(int[] numbers, int k){
	for(int i = 0; i < numbers.length; i++){
	for(int j = i + 1; j < numbers.length; j++){
	if(numbers[i] + numbers[j] == k){
	return new Pair(numbers[i], numbers[j]);
	}
	}
	}
	return null;
	}

	int findUniqueXOR(int[] numbers){
	int result = 0;
	for(int i: numbers){
	result ^= i;
	}
	return result;
	}