leetcode-81. 搜索旋转排序数组 II

leetcode-81. 搜索旋转排序数组 II

题目：

代码：

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool search(vector<int>& nums, int target) {
	if(std::find(nums.begin(), nums.end(), target) != nums.end()){
		return true;
	}else{
		return false;
	}
}

int main(){
	bool res;
	vector<int> nums;
	int target;
	int tn=0,fuhao=0;
	string s;
	getline(cin,s);
	cin>>target;
	for(int i=0;i<s.size();i++){
		if(s[i]==' '){
			if(fuhao==1){
				tn=-tn;
			}
			nums.push_back(tn);
			tn=0;fuhao=0;
		}else if(s[i]=='-'){
			fuhao=1;
		}else{
			tn=tn*10+s[i]-'0';
		}
	}
	if(fuhao==1){
		tn=-tn;
	}
	nums.push_back(tn);
	res=search(nums, target);
	if(res){
		cout<<"true";
	}else{
		cout<<"false";
	}
    return 0;
}