comefrom: <awangdev>245. Shortest Word Distance III_1.java
code: public int shortestWordDistance(String[] words, String word1, String word2) {
          Integer p1 = null, p2 = null;
          int distance = Integer.MAX_VALUE;
          for (int i = 0; i < words.length; i++) {
              String word = words[i];
              
              if (word.equals(word1) && word.equals(word2)) { 
                  if (p1 != null) distance = Math.min(distance, i - p1); 
                  p1 = i; 
                  continue;
              }
              if (words[i].equals(word1)) p1 = i;
              if (words[i].equals(word2)) p2 = i;
              if (p1 != null && p2 != null) distance = Math.min(distance, Math.abs(p1 - p2));
          }
          return distance;
      }
masked: public int sample_funcname ( String [ ] var_0 , String var_1 , String var_2 ) {
    Integer var_3 = null , var_4 = null ;
    int var_5 = Integer . MAX_VALUE ;
    for ( int var_6 = 0 ;
    var_6 < var_0 . length ;
    var_6 ++ ) {
      String var_7 = var_0 [ var_6 ] ;
      if ( var_7 . equals ( var_1 ) && var_7 . equals ( var_2 ) ) {
        if ( var_3 != null ) var_5 = Math . min ( var_5 , var_6 - var_3 ) ;
        var_3 = var_6 ;
        continue ;
      }
      if ( var_0 [ var_6 ] . equals ( var_1 ) ) var_3 = var_6 ;
      if ( var_0 [ var_6 ] . equals ( var_2 ) ) var_4 = var_6 ;
      if ( var_3 != null && var_4 != null ) var_5 = Math . min ( var_5 , Math . abs ( var_3 - var_4 ) ) ;
    }
    return var_5 ;
  }
  