I got this soln when I was doing Find Minimum in Roated Sorted Array, I think it should also works for II, and yes, it works!

```
public int findMin(int[] num) {
if(num==null){return 0;}
if(num.length<2) {return num[0];}
for(int i = 1; i < num.length; i++){
if(isDescending(num[i-1], num[i])){
continue; //continue if it is Des
}
else{
if(num[i-1] < num[num.length-1]){
return num[i-1]; // avoid Asc then Des again
}
else{ continue;} //if Asc and Des again keep checking if Descending
}
}
return num[num.length-1]; //if all are descending, the min is the last
}
public boolean isDescending(int prev, int cur){
if(prev >= cur) {return true;}
else{return false;}
}
```