zoukankan      html  css  js  c++  java
  • LeetCode

    题目:

    Given an array of integers, find two numbers such that they add up to a specific target number.

    The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

    You may assume that each input would have exactly one solution.

    Input: numbers={2, 7, 11, 15}, target=9
    Output: index1=1, index2=2

    思路:两层for循环

    package sum;
    
    public class TwoSum {
    
        public int[] twoSum(int[] nums, int target) {
            int len = nums.length;
            int[] res = new int[2];
            for (int i = 0; i < len - 1; ++i) {
                res[0] = i + 1;
                int rem = target - nums[i];
                for (int j = i + 1; j < len; ++j) {
                    if (nums[j] == rem) {
                        res[1] = j + 1;
                        return res;
                    }
                }
            }
            
            return res;
        }
        
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            TwoSum t = new TwoSum();
            int[] nums = {2, 7, 11, 15};
            int target = 9;
            int[] res = t.twoSum(nums, target);
            System.out.println(res[0]);
            System.out.println(res[1]);
        }
    
    }
  • 相关阅读:
    ARC 117 D
    Maven依赖踩坑记录
    MobaXterm连接本地CentOS7
    Git在IDEA下的常用操作
    mq消息中间件
    nginx的作用
    Git的使用
    docker
    redis
    导出excel
  • 原文地址:https://www.cnblogs.com/null00/p/5023736.html
Copyright © 2011-2022 走看看