面试算法题-01

原创于 2021-09-01 07:20:19 发布 · 123 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #面试 #java

Algorithm 专栏收录该内容

3 篇文章

订阅专栏

该博客介绍了一个编程问题，即在一个不包含重复元素的数组中找到两个数，使得它们的和等于给定的目标值。提供的解决方案是通过双重循环遍历数组，当找到满足条件的两个数时返回它们。如果找不到符合条件的数对，则返回空数组。这是一个典型的两数之和问题，常见于编程面试和算法练习。

1-Two number sum(两数之和)

write a function that takes in a non-empty array of distinct integers and an integer representing a target sum. if any two numbers in the input array sum up to the target sum, the function should return them in an array in any order. if no two numbers sum up to the target sum, the function should return an empty array.

sample input
array = [3, 5, -4, 8, 11, 1, -1, 6]
targetSum = 10
sample output
[-1, 11]

(1) idea:

traversing every element in array as first number
traversing every rest of elements as second number
if second number equals to tragetSum minus first number, then return the array with those two number

class solution{
	private int[] getTargetNumber(int[] array, int targetSum){
		for(int i = 0; i < array.length; i++){
			int first = array[i];
			for(int j = 1; j < array.length; j++){
				int second = array[j];
				if(targetSum - first == second){
					return new int[]{first, second};
				}
			}
			return new int[0];
		}
	}
}