class Solution {
public:
/**
* @param num: a rotated sorted array
* @return: the minimum number in the array
// write your code here
int tmpmin = num[0];
for ( int i = 1; i < num.size( ); i++ ){
if ( tmpmin>num[i] )
tmpmin = num[i];
}
return tmpmin;
}
};
public:
/**
* @param num: a rotated sorted array
* @return: the minimum number in the array
*/
//这个没有技巧,直接遍历
int findMin(vector<int> &num) {// write your code here
int tmpmin = num[0];
for ( int i = 1; i < num.size( ); i++ ){
if ( tmpmin>num[i] )
tmpmin = num[i];
}
return tmpmin;
}
};