C++学习（2）

LeetCode 2.1.3

Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.

不允许重复元素

代码1

#include<iostream>
#include<vector>
using namespace  std;
class Solution {
	public:
		int search(const vector<int>& nums, int target) {
			int first = 0, last = nums.size();
			while (first != last) {
				const int mid = first + (last - first) / 2;
				if (nums[mid] == target)
					return mid;
				if (nums[first] <= nums[mid]) {
					if (nums[first] <= target && target < nums[mid])
							last = mid;
					else
							first = mid + 1;
				} else {
						if (nums[mid] < target && target <= nums[last-1])
								first = mid + 1;
						else
								last = mid;
					}
			}
			return -1;
		}
};


int main(){
	Solution solution;
	int a[6] = {1,2,3,4,5,6};
	vector<int> va(a,a+6);
	for(int i = 0;i < va.size();i++)
		cout<<a[i]<<" ";
	cout<<endl;
	for(vector<int>::iterator it = va.begin();it != va.end();++it)
		cout<<*it<<" ";
	cout<<endl;
	int b = solution.search(va,4);
	cout<<endl;
	cout<<b<<endl;
	return 0;
	
}

运行后：

1 2 3 4 5 6 
1 2 3 4 5 6 

3

代码2

#include<iostream>
#include<vector>
using namespace  std;
class Solution {
	public:
		int search(const vector<int>& nums, int target) {
			for(int i = 0;i < nums.size();i++){
				if(nums[i] == target)
					return i;
			}	
			return -1;
		}
};

int main(){
	Solution solution;
	int a[6] = {1,2,3,4,5,6};
	vector<int> va(a,a+6);
	for(int i = 0;i < va.size();i++)
		cout<<a[i]<<" ";
	cout<<endl;
	for(vector<int>::iterator it = va.begin();it != va.end();++it)
		cout<<*it<<" ";
	cout<<endl;
	int b = solution.search(va,4);
	cout<<endl;
	cout<<b<<endl;
	return 0;
	
}

运行后：

1 2 3 4 5 6 
1 2 3 4 5 6 

3

LeetCode 2.1.4

允许重复元素

#include<iostream>
#include<vector>
using namespace  std;
class Solution {
	public:
		int search(const vector<int>& nums, int target) {
			int first = 0, last = nums.size();
			while (first != last) {
				const int mid = first + (last - first) / 2;
				if (nums[mid] == target)
					return mid;
				if (nums[first] < nums[mid]) {
						if (nums[first] <= target && target < nums[mid])
							last = mid;
						else
							first = mid + 1;
				} else if (nums[first] > nums[mid]) {
							if (nums[mid] < target && target <= nums[last-1])
									first = mid + 1;
							else
									last = mid;
				} else
						//skip duplicate one
						first++;
			}
			return -1;
		}
};

int main(){
	Solution solution;
	int a[8] = {1,1,2,3,4,5,6,6};
	vector<int> va(a,a+8);
	for(int i = 0;i < va.size();i++)
		cout<<a[i]<<" ";
	cout<<endl;
	for(vector<int>::iterator it = va.begin();it != va.end();++it)
		cout<<*it<<" ";
	cout<<endl;
	int b = solution.search(va,3);
	cout<<endl;
	cout<<b<<endl;
	return 0;
	
}

运行后：

1 1 2 3 4 5 6 6 
1 1 2 3 4 5 6 6 

3