[关闭]
@aloyschen 2017-09-29T15:32:14.000000Z 字数 564 阅读 95

CodeWars 刷题总结

CodeWars


Maximum Length Difference

You are given two arrays a1 and a2 of strings. Each string is composed with letters from a to z. Let x be any string in the first array and y be any string in the second array.

Find max(abs(length(x) − length(y)))

If a1 or a2 are empty return -1 in each language except in Haskell (F#) where you will return Nothing (None).

Example:

s1 = ["hoqq", "bbllkw", "oox", "ejjuyyy", "plmiis", "xxxzgpsssa", "xxwwkktt", "znnnnfqknaz", "qqquuhii", "dvvvwz"]
s2 = ["cccooommaaqqoxii", "gggqaffhhh", "tttoowwwmmww"]
mxdiflg(s1, s2) --> 13

知识点

添加新批注
在作者公开此批注前,只有你和作者可见。
回复批注