forked from yzhu798/CodingInterviewsNotes
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsearch.cpp
More file actions
125 lines (115 loc) · 2.71 KB
/
search.cpp
File metadata and controls
125 lines (115 loc) · 2.71 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
#include "search.h"
Search::Search()
{
}
int Search::SequenceSearch(vector<int> &arr, int key)
{
for(int i=0;i< arr.size();i++){
if(arr[i] == key)
{
cout<<"find key at:"<<i<<endl;
return i;
}
}
cout<<"failed find key "<<key<<endl;
return -1;
}
int Search::binarySearch(const vector<int> &arr, int key)
{
int low =0;
int high =arr.size()-1;
int mid ;
while(low <= high){
mid = low + (high -low)/2;
if(arr[mid] == key)
{
cout<<"find key at:"<<mid<<endl;
return mid;
}
if(arr[mid] < key){
low = mid+1;
}
if(arr[mid] > key){
high = mid-1;
}
}
cout<<"failed find key "<<key<<endl;
return -1;
}
int Search::binarySearch(const vector<int> &arr, int low, int high,int key)
{
if(low < 0 || high > arr.size()){
cout<<"rang is err"<<endl;
return -1;
}
if(low > high){
cout<<"failed find key "<<key<<endl;
return -1;
}
int mid = low+ (high -low) /2;
if(arr[mid] == key)
{
cout<<"find key at:"<<mid<<endl;
return mid;
}
if(arr[mid] < key){
return binarySearch(arr, mid+1, high,key);
}
if(arr[mid] > key){
return binarySearch(arr, low, mid-1,key);
}
}
//分布均匀下按比例查找
int Search::InsertionSearch(const vector<int> &arr, int low, int high, int key)
{
if(low < 0 || high > arr.size()){
cout<<"rang is err"<<endl;
return -1;
}
if(low > high){
cout<<"failed find key "<<key<<endl;
return -1;
}
int mid = low+ (key - arr[low])/(arr[high] -arr[low]) * (high - low);
if(arr[mid] == key)
{
cout<<"find key at:"<<mid<<endl;
return mid;
}
if(arr[mid] < key){
return binarySearch(arr, mid+1, high,key);
}
if(arr[mid] > key){
return binarySearch(arr, low, mid-1,key);
}
}
void Search::GetAllNotIncluded(vector<int> &A,vector<int> &B)
{
vector<int> res;
// 遍历B中每一个元素，每次用元素与 A中元素进行二分比较，不存在加入到结果中
for (int i = 0; i < B.size(); i++) {
int l = 0;
int r = A.size() - 1;
bool contains = false;
while (l <= r) {
int mid = l + ((r - l) >> 1);
if (A[mid] == B[i]) {
contains = true;
break;
}
if (A[mid] > B[i]) {
r = mid - 1;
} else {
l = mid + 1;
}
}
if (!contains) {
res.push_back(B[i]);
}
}
cout <<endl<<"GetAllNotIncluded B "<<endl;
for(auto i:res){
cout <<i<<" ";
}
cout <<endl;
}