<qiyuangong>001_Two_Sum_1.java
public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            int x = nums[i];
            if (map.containsKey(target - x)) {
                return new int[]{map.get(target - x), i};
            }
            map.put(x, i);
        }
        throw new IllegalArgumentException("No two sum solution");
    }
public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
  Map < Integer , Integer > var_5 = new HashMap < > ( ) ;
  for ( int var_7 = 0 ;
  var_7 < var_0 . length ;
  var_7 ++ ) {
    int var_9 = var_0 [ var_7 ] ;
    if ( var_5 . containsKey ( var_1 - var_9 ) ) {
      return new int [ ] {
        var_5 . get ( var_1 - var_9 ) , var_7 };
      }
      var_5 . put ( var_9 , var_7 ) ;
    }
    throw new IllegalArgumentException ( "No two sum solution" ) ;
  }
  