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.
Vincoli
0 ≤ number of messages ≤ 10,000
Texts have 1 to 2,000 characters
Esempi
Input:
messages = ["email Welcome!", "sms Your code is 1234", "push New follower"]
Output atteso:
expected = 6Input:
std::vector<std::string> messages = {"email Welcome!", "sms Your code is 1234", "push New follower"};
Output atteso:
long long expected = 6;Input:
string[] messages = new string[] {"email Welcome!", "sms Your code is 1234", "push New follower"};
Output atteso:
long expected = 6;Spiegazione
Email costs 1, the short SMS uses one block (5) and push is free: 6.
Input:
messages = ["sms aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"]
Output atteso:
expected = 10Input:
std::vector<std::string> messages = {"sms aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"};
Output atteso:
long long expected = 10;Input:
string[] messages = new string[] {"sms aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"};
Output atteso:
long expected = 10;Spiegazione
161 characters need two 160-character blocks: 2 × 5 = 10.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Split each message once at the first space into channel and text.
Suggerimento 2
For SMS, count blocks with ceiling division: (length + 159) / 160.
Suggerimento 3
Push messages cost nothing, so they add 0.
Complessità attesa
O(total length) time, O(1) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.