<awangdev>1. Two Sum_1.java
public int[] twoSum(int[] nums, int target) {
        int[] rst = new int[2];
        if (nums == null || nums.length <= 1) return rst;

        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) {
                rst[0] = map.get(target - nums[i]);
                rst[1] = i;
                break;
            } 
            map.put(nums[i], i);
        }
        return rst;
    }
public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
  int [ ] var_3 = new int [ 2 ] ;
  if ( var_0 == null || var_0 . length <= 1 ) return var_3 ;
  Map < Integer , Integer > var_10 = new HashMap < > ( ) ;
  for ( int var_12 = 0 ;
  var_12 < var_0 . length ;
  var_12 ++ ) {
    if ( var_10 . containsKey ( var_1 - var_0 [ var_12 ] ) ) {
      var_3 [ 0 ] = var_10 . get ( var_1 - var_0 [ var_12 ] ) ;
      var_3 [ 1 ] = var_12 ;
      break ;
    }
    var_10 . put ( var_0 [ var_12 ] , var_12 ) ;
  }
  return var_3 ;
}
