CodeWars 刷题总结

CodeWars

Basic Nico variation

Task

Write a function nico/nico() that accepts two parameters:

key/$key - string consists of unique letters and digits message/$message - string to encode
and encodes the message using the key.

First create a numeric key basing on a provided key by assigning each letter position in which it is located after setting the letters from key in an alphabetical order.

For example, for the key crazy we will get 23154 because of acryz (sorted letters from the key).
Let's encode secretinformation using our crazy key.

2 3 1 5 4
---------
s e c r e
t i n f o
r m a t i
o n
After using the key:
1 2 3 4 5
---------
c s e e r
n t i o f
a r m i t
  o n
Notes

The message is never shorter than the key.

Examples

nico("crazy", "secretinformation") => "cseerntiofarmit on  "
nico("abc", "abcd") => "abcd  "
nico("ba", "1234567890") => "2143658709" 
nico("key", "key") => "eky"
Check the test cases for more samples.

知识点

• 这个题目主要有两个关键点，第一个是根据key构建一个排序后的字典，第二个是怎么填补没有对应位置的字符，如例子中message有17个字符，但是转换后需要有20个字符，因此需要计算之后总的字符个数，然后用空格填充缺失的字符