comefrom: <qiyuangong>485_Max_Consecutive_Ones_1.java
code: public int findMaxConsecutiveOnes(int[] nums) {
          int ans = 0;
          int curr = 0;
          for (int i = 0; i < nums.length; i++) {
              if (nums[i] == 1) {
                  curr++;
                  if (curr > ans) ans = curr;
              } else {
                  curr = 0;
              }
          }
          return ans;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    int var_1 = 0 ;
    int var_2 = 0 ;
    for ( int var_3 = 0 ;
    var_3 < var_0 . length ;
    var_3 ++ ) {
      if ( var_0 [ var_3 ] == 1 ) {
        var_2 ++ ;
        if ( var_2 > var_1 ) var_1 = var_2 ;
      }
      else {
        var_2 = 0 ;
      }
    }
    return var_1 ;
  }
  