1. Two Sum

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].

submit:

public class Solution {    public static int[] twoSum(int[] nums, int target) {    int[] result = new int[2];    boolean continued = true;    for (int i = 0; i < nums.length; i++) {    if(continued) {    for(int j = i; j < nums.length; j++) {    if(i != j && nums[i] + nums[j] == target) {    result[0] = i;    result[1] = j;    continued = false;    break;    }    }    }    }    return result;}}