摘要： int camelcase(string s) { int cnt=0; int a; for(int i=0;i<s.size();i++) { a=s[i]; if(65<=a&&a<=90) { cnt++; } } cnt++; return cnt; } int camelcase(str 阅读全文

摘要： Steve has a string of lowercase characters in range ascii[‘a’..’z’]. He wants to reduce the string to its shortest length by doing a series of operati 阅读全文