LeetCode两数之和-java

chenxiky

已于 2022-06-07 00:02:31 修改

阅读量132

点赞数

分类专栏： LeetCode 文章标签： leetcode 散列表算法

于 2022-06-06 23:59:42 首次发布

本文链接：https://blog.csdn.net/weixin_44080187/article/details/125156867

版权

LeetCode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

一.暴力破解


        public int[] twoSum(int[] nums, int target) {
            int[] res = new int[2];
            for (int i = 0; i < nums.length; i++) {
                for (int j = i+1; j < nums.length; j++) {
                    if (nums[i] + nums[j] == target) {
                        res[0] = i;
                        res[1] = j;
                        break;
                    }
                }
            }
            return res;
        }

二.ArrayList


    public int[] twoSum(int[] nums, int target) {
        int[] res = new int[2];
        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < nums.length; i++) {
            if (list.contains(nums[i])) {
                res[0] = list.indexOf(nums[i]);
                res[1] = i;
            }
            list.add(target - nums[i]);
        }
        return res;
    }

三.hashMap

 class Solution {
        public int[] twoSum(int[] nums, int target) {
            int[] res = new int[2];
            HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
            for (int i = 0; i < nums.length; i++) {
                if (map.containsKey(nums[i])) {
                    res[0] = map.get(nums[i]);
                    res[1] = i;
                }
                map.put(target - nums[i], i);
            }
            return res;
        }
    }