LeetCode 算法学习

计算两个数字之和

public class GetNum {
    public static void main(String[] args) {
        int[] nums = {4, 7, 7, 11, 15, 10, 7};
        int target = 14;
        List<int[]> result = twosum_input_contain_duplication(nums, target);
        result.forEach(item -> {
            System.out.println(Arrays.toString(item));
        });
    }

    /**
     * 获取数据
     *
     * @param nums
     * @param target
     * @return
     */
    private static int[] TwoNum(int[] nums, int target) {
        int length = nums.length;
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < length; i++) {
            if (map.containsKey(target - nums[i])) {
                return new int[]{map.get(target - nums[i]), i};
            } else {
                map.put(nums[i], i);
            }
        }
        return new int[0];
    }

    /**
     * 一个数组中包含多个相同的数据
     *
     * @param nums
     * @param target
     * @return
     */
    private static List<int[]> getTwoNum(int[] nums, int target) {
        //保存返回的结果
        List<int[]> lists = new ArrayList<>();
        //值和下标的保存值
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) {
                lists.add(new int[]{map.get(target - nums[i]), i});
            }
            map.put(nums[i], i);
        }
        return lists;
    }

    public static List<int[]> twosum_input_contain_duplication(int[] nums, int target) {
        // 存储结果
        ArrayList<int[]> arrayList = new ArrayList<>();
        // 定义两个指针，pBegin头指针，pEnd尾指针
        int pOld = 0;
        int pBegin = 0;
        int pEnd = nums.length - 1;
        // 开始从头遍历
        while (pBegin < pEnd) {
            // 保存当前pEnd值
            pOld = pEnd;
            // 先固定pBegin，从后往前查找
            while (pBegin < pEnd) {
                // 找到相加等于target的整数
                if (nums[pBegin] + nums[pEnd] == target) {
                    int[] res = new int[2];
                    res[0] = pBegin;
                    res[1] = pEnd;
                    arrayList.add(res);
                }
                pEnd--;
            }
            pEnd = pOld;
            pBegin++;
        }
        return arrayList;
    }
}