Aktiver Arbeitgeber
code-> #include <stdio.h> using namespace std; #include<vector> void grep(int key, vector<int> input_string, int k) { int before, after, current, size; size = input_string.size(); before = after = current = 0; boolean flag = false; for(int i = 0; i< size; i++) { if( input_string[i] == key ) { flag = true; } current = i; if( current >= k ) { before = current - k; } if( ( size - current - 1 ) > k ) { after = current + k ; } else { after = current + ( size - current - 1); } if( !flag ) continue; else break; } for(int i = before; i <= after; i++) { print<< input_string[i] << "-"; } cout<<endl; } int main() { int key = 1; int k =2; vector<int> input_string1 = {2,3,4,5,1,6,7,8,9}; vector<int> input_string2 = {1,2,3,4,5,6,7,8,9}; vector<int> input_string3 = {2,3,4,5,6,7,8,9,1}; print<<"grep("<<key<<",input_string1,"<<k<<");"<<end l; grep(key, input_string1, k); print<<"grep("<<key<<",input_string2,"<<k<<");"<<end l; grep(key, input_string2, k); print<<"grep("<<key<<",input_string3,"<<k<<");"<<end l; grep(key, input_string3, k); k = 4; print<<"grep("<<key<<",input_string1,"<<k<<");"<<end l; grep(key, input_string1, k); print<<"grep("<<key<<",input_string2,"<<k<<");"<<end l; grep(key, input_string2, k); print<<"grep("<<key<<",input_string3,"<<k<<");"<<end l; grep(key, input_string3, k); k = 0; print<<"grep("<<key<<",input_string1,"<<k<<");"<<end l; grep(key, input_string1, k); print<<"grep("<<key<<",input_string2,"<<k<<");"<<end l; grep(key, input_string2, k); print<<"grep("<<key<<",input_string3,"<<k<<");"<<end l; grep(key, input_string3, k); k = 100; print<<"grep("<<key<<",input_string1,"<<k<<");"<<end l; grep(key, input_string1, k); print<<"grep("<<key<<",input_string2,"<<k<<");"<<end l; grep(key, input_string2, k); print<<"grep("<<key<<",input_string3,"<<k<<");"<<end l; grep(key, input_string3, k); } --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------