Skip to content

Instantly share code, notes, and snippets.

@kwojcicki
Created December 1, 2019 23:09
Show Gist options
  • Save kwojcicki/71b8e2512013893b7a2e7f780d113b3c to your computer and use it in GitHub Desktop.
Save kwojcicki/71b8e2512013893b7a2e7f780d113b3c to your computer and use it in GitHub Desktop.
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;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment