求两数之和

 1 class Solution {
 2     public int[] twoSum(int[] nums, int target) {
 3         int length = nums.length;
 4         int[] result = new int[2];
 5         int temp = 0;
 6         for(int i=0;i<length-1;i++){
 7             temp = target -nums[i];
 8             for(int j=i+1;j<length;j++){
 9                 if(nums[j]==temp){
10                     result[0]=i;
11                     result[1]=j;
12                     break;
13                 }
14             }
15         }
16         return result;  
17     }
18 }

 1 class Solution {
 2     public int[] twoSum(int[] nums, int target) {
 3     
 4         int[] result=new int[0];
 5         int temp = 0;
 6         for(int i=0;i<nums.length-1;i++){
 7              temp = target -nums[i];
 8              for(int j=i+1;j<nums.length;j++){
 9                  if(nums[j]==temp){
10                         result = new int[2];
11                         result[0]=i;
12                         result[1]=j;
13                          break;
14                  }
15              }
16         }
17         return result;  
18     }
19 }