findMinimumInRotatedSortedArray not accept about leetcode HOT 4 CLOSED

I just re-tested it, it's no problem! could you please double check it?

from leetcode.

int main(int argc, char** argv)
{
#if 1 // test case { 2, 3, 1, 4, 5, 6, 7 }; the min is 1
vector num;
num.push_back(2);
num.push_back(3);
num.push_back(1);
num.push_back(4);
num.push_back(5);
num.push_back(6);
num.push_back(7);
int rst = findMin(num);
printf("%d\n", rst);
#else
....
#endif
return 0;
}

print 2

from leetcode.

Oh, I see! the problem here is the test data { 2, 3, 1, 4, 5, 6, 7 }; which is not rotated sorted array !

from leetcode.

Oh,sorry! I know !

发自我的 Windows Phone

发件人: Hao Chenmailto:[email protected]
发送时间: ‎2014/‎10/‎31 18:20
收件人: haoel/leetcodemailto:[email protected]
抄送: yangdm0209mailto:[email protected]
主题: Re: [leetcode] findMinimumInRotatedSortedArray not accept (#15)

Oh, I know! the array { 2, 3, 1, 4, 5, 6, 7 }; is not rotated sorted array !

Reply to this email directly or view it on GitHub:
#15 (comment)

from leetcode.