字符串 - 基础

写一个程序来决定字符串是否是回文。以下字符串是一个parindrome吗?

1
ajkmlnfdbkstrubjqazwsqwertyuiopfunasdfghjklxlkhjgfdsanufpoiuytrewqswzaqjburtskbdfnlmkja.

写一个函数返回子串发生在字符串中的次数。

在下面的字符串中,字符串“eat”发生了多少次?

1
EATAUDRYBERNITAEATVIVANBROOKSEATJENIEATMICHALELASANDRALATIAEATLIDIAEATDEANDRAEATSYBILEATMONROEEATLATRISHAALTAEATDERICKROSANNLEVILIBBYKIRSTENCHARLESEATELLYNEATJANEEEATSTASIAEATJULIETTARANDIEATNORBERTSAGEEATARACELIKATINAMERNAEATISAIASWINNIEEATARLETHAEATMILOCAMIEEATANNABELEATLEANORABERTHASYBLECHANAEATREAGANERICKVALENTINAEATDORETHEASEBASTIANKRISROBERTAEATIVONNEEAT

给定ASCII字符串,找到字符串中所有数字字符的总和。例如,对于'abc1234z',所有数字字符的总和是 1 + 2 + 3. + 4. = 10. 1 + 2 + 3 + 4 = 10 。下面的字符串中所有数字字符的总和是多少?

1
'96H11K4959Q615948S50922O38H1453ij38w73413d5577750vf100zd297750vf100zd29z73j5wwh7316965950vf100s509220vf100zd297750vf100zd29z73j5wwh7316965950vf100zd2965650vm77cw10awrjr2926528922223894992222386528922223810013uk10062f9449acbhfgcm35j78q80'

×

问题加载......

注意加载......

设置加载......