#include<stdio.h>
#include<iostream>
#include<string>
#include<malloc.h>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
void searchQueue(queue<int> q, int searchValue) {
int pos = 0;
bool searchFlag = false;
for(int i=0; i<q.size(); ++i) {
if(q.front() == searchValue && !searchFlag) {
cout << pos;
searchFlag = true;
}
else {
q.push(q.front());
q.pop();
pos++;
}
}
}
int main() {
queue<int> q;
q.push(1);
q.push(2);
q.push(3);
searchQueue(q, 2);
}
Processed:
0.011, SQL:
9
