zoukankan      html  css  js  c++  java
  • TwoSun

    Given an array of integers, return indices of the two numbers such that they add up to a specific target.

    You may assume that each input would have exactly one solution, and you may not use the same element twice.

    Example

    Given nums = [2, 7, 11, 15], target = 9,
    
    Because nums[0] + nums[1] = 2 + 7 = 9,
    return [0, 1].
    package com.coder520.jxc.leetcode;
    
    /**
     * Given nums = [2, 7, 11, 15], target = 9,
     *
     * Because nums[0] + nums[1] = 2 + 7 = 9,
     * return [0, 1].
     * @author liugang
     * @create 2018/12/19 23:47
     **/
    public class TwoSun {
    
        public int[] twoSum(int[] nums,int target){
            for(int i=0;i<nums.length;i++){
                for(int j=i+1;j<nums.length;j++){
                    if(nums[j]==target-nums[i]){
                        return new int[] {i,j};
                    }
                }
            }
            throw  new IllegalArgumentException("No two sum solution");
        }
    }
  • 相关阅读:
    jdk1.8安装与配置
    java编译器——idea的安装
    原型设计作业
    案例分析作业
    202103226-1 编程作业
    阅读任务
    准备工作
    java课程总结
    第十四周总结
    第十三周总结
  • 原文地址:https://www.cnblogs.com/fuckingPangzi/p/10147042.html
Copyright © 2011-2022 走看看