AcWing-75:和为S的两个数字(Java语言实现)

class Solution {
    public int[] findNumbersWithSum(int[] nums, int target) {
        int j = 0,k = 0;
        Arrays.sort(nums);

        for (int p = 0; p < nums.length - 1; p++) {
            for (int q = p+1; q < nums.length; q++) {
                if (nums[p] + nums[q] == target){
                    j = p;
                    k = q;
                }
            }
        }
        return new int[]{nums[j],nums[k]};
    }
}