<qiyuangong>1337_The_K_Weakest_Rows_in_a_Matrix_1.java
public int[] kWeakestRows(int[][] mat, int k) {
        List<Integer> res = new ArrayList<>();
        int col = 0;
        boolean flag = true;
        while (col < mat[0].length && flag) {
            for (int i = 0; i < mat.length; i++) {
                if (res.contains(i)) continue;
                if (mat[i][col] == 0) res.add(i);
                if (res.size() == k) {
                    flag = false;
                    break;
                }
            }
            col += 1;
        }
        if (flag) {
            for (int i = 0; i < mat.length; i++) {
                if (res.contains(i)) continue;
                res.add(i);
                if (res.size() == k) break;
            }
        }
        int[] ret = new int[k];
        for (int i = 0; i < k; i++) ret[i] = res.get(i);
        return ret;
    }
public int [ ] sample_funcname ( int [ ] [ ] var_0 , int var_1 ) {
  List < Integer > var_5 = new ArrayList < > ( ) ;
  int var_7 = 0 ;
  boolean var_10 = true ;
  while ( var_7 < var_0 [ 0 ] . length && var_10 ) {
    for ( int var_11 = 0 ;
    var_11 < var_0 . length ;
    var_11 ++ ) {
      if ( var_5 . contains ( var_11 ) ) continue ;
      if ( var_0 [ var_11 ] [ var_7 ] == 0 ) var_5 . add ( var_11 ) ;
      if ( var_5 . size ( ) == var_1 ) {
        var_10 = false ;
        break ;
      }
    }
    var_7 += 1 ;
  }
  if ( var_10 ) {
    for ( int var_11 = 0 ;
    var_11 < var_0 . length ;
    var_11 ++ ) {
      if ( var_5 . contains ( var_11 ) ) continue ;
      var_5 . add ( var_11 ) ;
      if ( var_5 . size ( ) == var_1 ) break ;
    }
  }
  int [ ] var_16 = new int [ var_1 ] ;
  for ( int var_11 = 0 ;
  var_11 < var_1 ;
  var_11 ++ ) var_16 [ var_11 ] = var_5 . get ( var_11 ) ;
  return var_16 ;
}
