<awangdev>Find Minimum in Rotated Sorted Array II_2.java
public int findMin(int[] num) {
        if (num == null || num.length == 0) {
            return -1;
        }
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < num.length; i++) {
            if (min > num[i]) {
                min = num[i];
            }
        }
        return min;
    }
public int sample_funcname ( int [ ] var_0 ) {
  if ( var_0 == null || var_0 . length == 0 ) {
    return - 1 ;
  }
  int var_7 = Integer . MAX_VALUE ;
  for ( int var_8 = 0 ;
  var_8 < var_0 . length ;
  var_8 ++ ) {
    if ( var_7 > var_0 [ var_8 ] ) {
      var_7 = var_0 [ var_8 ] ;
    }
  }
  return var_7 ;
}
