Problema
Polymorphism lets code call the same method on different objects and get behaviour specific to each one. Here every channel computes the cost of a message its own way.
Each message is <channel> <text>, where the text is everything after the first space:
email: costs 1.sms: costs 5 for every started block of 160 characters of text (1 to 160 characters is one block).push: free.
Implement notification_cost(messages).
Input
messages: The messages to send. SMS texts have at least one character.
Output
Return the total cost.
Restricciones
0 ≤ number of messages ≤ 10,000
Texts have 1 to 2,000 characters
Ejemplos
Entrada:
messages = ["email Welcome!", "sms Your code is 1234", "push New follower"]
Salida esperada:
expected = 6Entrada:
std::vector<std::string> messages = {"email Welcome!", "sms Your code is 1234", "push New follower"};
Salida esperada:
long long expected = 6;Entrada:
string[] messages = new string[] {"email Welcome!", "sms Your code is 1234", "push New follower"};
Salida esperada:
long expected = 6;Explicación
Email costs 1, the short SMS uses one block (5) and push is free: 6.
Entrada:
messages = ["sms aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"]
Salida esperada:
expected = 10Entrada:
std::vector<std::string> messages = {"sms aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"};
Salida esperada:
long long expected = 10;Entrada:
string[] messages = new string[] {"sms aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"};
Salida esperada:
long expected = 10;Explicación
161 characters need two 160-character blocks: 2 × 5 = 10.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Split each message once at the first space into channel and text.
Pista 2
For SMS, count blocks with ceiling division: (length + 159) / 160.
Pista 3
Push messages cost nothing, so they add 0.
Complejidad esperada
O(total length) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.