7.两数之和

给定一个整数数组 ，从数组中找出两个数满足相加之和等于目标数 target 。

package com.spj.algorithm;


import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

/*
 *@program:架构师
 *@Author:peng
 *@Time:2022/4/8  14:02
 *
 */
public class _7_towSum {
    public static void main(String[] args) {
        int []arr=new int[]{1,4,5,9,7};
//        System.out.println(Arrays.toString(towSearch(arr,10)));
        System.out.println(Arrays.toString(towPoint(arr,10)));
    }
    /*无序*/
    public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < nums.length; ++i) {
            if (map.containsKey(target - nums[i])) {
                return new int[]{map.get(target - nums[i]), i};
            }
            map.put(nums[i], i);
        }
        return new int[0];
    }
    /*有序*/
    private static int[] towPoint(int[] arr, int target) {
        Arrays.sort(arr);
        int pl=0,pr=arr.length-1;
        while (pl<pr){
            int num=arr[pl]+arr[pr];
            if (num==target){
                return new int[]{pl+1,pr+1};
            }else if(num>target){
                pr--;
            }else {
                pl++;
            }
        }
        return new int[]{-1,-1};
    }

    private static int[] towSearch(int[] arr, int target) {
        Arrays.sort(arr);
        for (int i = 0; i < arr.length; i++) {
            int low=i,high=arr.length-1;
            while (low<=high){
                int mid=(high-low)/2+low;
                if (arr[i]+arr[mid]>target){
                    high=mid-1;
                }else if(arr[mid]+arr[i]<target){
                    low=mid+1;
                }else {
                    return new int[]{i,mid};
                }
            }
        }
       return new int[]{-1,-1};
    }

}