Условие
A to-do app keeps tasks in a typed collection such as List<T>. Each task has a title and a done flag.
Start with an empty list and process the operations, each a command and a title (the title is everything after the first space):
add <title>: add a pending task at the end, unless a task with that title already exists.done <title>: mark that task as done (no effect if it does not exist).remove <title>: delete that task (no effect if it does not exist).
Implement todo_list(operations).
Input
operations: The operations. Titles may contain spaces and are compared exactly.
Output
Return the titles of the tasks that are not done, in the order they were added.
Ограничения
0 ≤ number of operations ≤ 10,000
Titles have 1 to 50 characters
Примеры
Ввод:
operations = ["add Buy milk", "add Write report", "done Buy milk", "add Call Ada"]
Ожидаемый вывод:
expected = ["Write report", "Call Ada"]
Ввод:
std::vector<std::string> operations = {"add Buy milk", "add Write report", "done Buy milk", "add Call Ada"};
Ожидаемый вывод:
std::vector<std::string> expected = {"Write report", "Call Ada"};
Ввод:
string[] operations = new string[] {"add Buy milk", "add Write report", "done Buy milk", "add Call Ada"};
Ожидаемый вывод:
string[] expected = new string[] {"Write report", "Call Ada"};
Пояснение
Buy milk is done, so only the other two remain, in the order they were added: ["Write report", "Call Ada"].
Ввод:
operations = ["add Gym", "add Gym", "remove Gym", "done Gym"]
Ожидаемый вывод:
expected = []
Ввод:
std::vector<std::string> operations = {"add Gym", "add Gym", "remove Gym", "done Gym"};
Ожидаемый вывод:
std::vector<std::string> expected = {};
Ввод:
string[] operations = new string[] {"add Gym", "add Gym", "remove Gym", "done Gym"};
Ожидаемый вывод:
string[] expected = new string[] {};
Пояснение
The second add is ignored because Gym already exists; removing it leaves nothing, and done on a missing task does nothing: [].
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
Store each task as a small record of title and done.
Подсказка 2
Look a task up by its exact title before adding, completing or removing it.
Подсказка 3
At the end keep only the tasks that are not done, in insertion order.
Ожидаемая сложность
O(n²) time, O(n) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.