![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codewars
文章平均质量分 78
yy406961
这个作者很懒,什么都没留下…
展开
-
codewars解题笔记 —— 将字符串转驼峰,单词首字母大写
题目:Complete the method/function so that it converts dash/underscore delimited words into camel casing. The first word within the output should be capitalized only if the original word was capitalized.原创 2017-09-08 17:46:31 · 1149 阅读 · 0 评论 -
codewars解题笔记 —— 字符串匹配
题目 In this kata you are required to, given a string, replace every letter with its position in the alphabet. If anything in the text isn't a letter, ignore it and don't return it a being 1, b being原创 2017-09-21 15:14:48 · 871 阅读 · 0 评论 -
codewars解题笔记 —— 字符串的筛选和拼接
题目: Your job is to write a function which increments a string, to create a new string. If the string already ends with a number, the number should be incremented by 1. If the string does not end with原创 2017-09-26 21:26:26 · 682 阅读 · 0 评论 -
codewars解题笔记 —— 匹配字符串
题目 What is an anagram? Well, two words are anagrams of each other if they both contain the same letters. For example: 'abba' & 'baab' == true 'abba' & 'bbaa' == true 'abba' & 'abbba' == false原创 2017-09-16 17:34:16 · 419 阅读 · 0 评论 -
codewars解题笔记 —— 数组的判断
题目: You get an array of arrays. If you sort the arrays by their length, you will see, that their length-values are consecutive. But one array is missing! You have to write a method, that return原创 2017-09-20 20:38:15 · 560 阅读 · 0 评论