13090 - Vector   

Description

Implement below six functions related to vector<int>.

 

void InsertBack(vector<int> &v, int num)insert the number n into v from back.

For example:

insert 1 // vec = {1}

insert 2 // vec = {1, 2}

 

void Erase(vector<int> &v, int num)delete the first number num found in v.

note: if there is no number num in v, print string “Can't find element: num” with a return value at the end.

For example:

insert 1 // vec = {1}

insert 2 // vec = {1, 2}

insert 1 // vec = {1, 2, 1}

erase 1 // vec = {2, 1}

erase 3 // there is no 3 in vec

Can’t find element: 3

 

void Reverse(vector<int> &v) – reverse all the elements in v.

For example:

insert 1 // vec = {1}

insert 2 // vec = {1, 2}

reverse // vec = {2, 1}

 

void Sort(vector<int> &v) – sort all the elements in v in ascending order.

note: you may use std::sort

For example:

insert 1 // vec = {1}

insert 3 // vec = {1, 3}

insert 2 // vec = {1, 3, 2}

sort // vec = {1, 2, 3}

 

void Print(vector<int> &v) – print out all the elements in v in index order. Each two elements (numbers) are separate by a space ‘ ‘.

note: if there is no elements in v, print string “None” with a return value at the end.

For example:

print // at first, vec is empty = {}

None

insert 1 // vec = {1}

insert 3 // vec = {1, 3}

insert 2 // vec = {1, 3, 2}

print // print out in index order

1 3 2

 

void Clear(vector<int> &v) – clear all the elements in v.

For example:

insert 1 // vec = {1}

insert 3 // vec = {1, 3}

insert 2 // vec = {1, 3, 2}

clear // vec is empty = {}

Input

There are six kinds of input command.

insert num – Call InsertBack(<vector reference>, num).

erase num – Call Erase(<vector reference>, num).

reverse – Call Reverse(<vector reference>).

sort – Call Sort(<vector reference>).

print – Call Print(<vector reference>).

clear – Call Clear(<vector reference>).

Output

Output followed by above rules.

Sample Input  Download

Sample Output  Download

Partial Judge Code

13090.cpp

Partial Judge Header

13090.h

Tags




Discuss