Code Hunt Sector 06 Strings - Java
2016-06-04 00:00
423 查看
摘要: Code Hunt Sector 06 Strings - Java
微软编码游戏 https://www.codehunt.com
Code Hunt 06.01
Code Hunt 06.02 - 没有找到三星解法
一星解法:
二星解法:
Code Hunt 06.03 - 没有找到三星解法
二星解法:
Code Hunt 06.04
Code Hunt 06.05
Code Hunt 06.06
Code Hunt 06.07
Code Hunt 06.08
Code Hunt 06.09
Code Hunt 06.10
Code Hunt 06.11
Code Hunt 06.12
一星解法:
三星解法(令人无语):
微软编码游戏 https://www.codehunt.com
Code Hunt 06.01
[code=language-java]public class Program { public static Boolean Puzzle(String s) { return false; } }
Code Hunt 06.02 - 没有找到三星解法
一星解法:
[code=language-java]public class Program { public static String Puzzle(String s) { char[] c = s.toCharArray(); for (int i = 0; i < c.length; i += 2) { c[i] = Character.toUpperCase(c[i]); } return new String(c); } }
二星解法:
[code=language-java]public class Program { public static String Puzzle(String s) { s = s.length() > 1 ? s.substring(0, 1).toUpperCase() + s.substring(1) : s.toUpperCase(); return s.length() > 2 ? s.substring(0, 2) + Puzzle(s.substring(2)) : s; } }
Code Hunt 06.03 - 没有找到三星解法
二星解法:
[code=language-java]public class Program { public static String Puzzle(String s) { char[] c = s.toCharArray(); for (int i = 0; i < c.length; i++) { if (i == c.length - 1 || c[i + 1] == ' ') { c[i] = Character.toUpperCase(c[i]); } } return new String(c); } }
Code Hunt 06.04
[code=language-java]public class Program { public static char Puzzle(String s, int x) { return s.charAt(x); } }
Code Hunt 06.05
[code=language-java]public class Program { public static String Puzzle(String one, String two) { return two.concat(one); } }
Code Hunt 06.06
[code=language-java]public class Program { public static String Puzzle(String s) { return s.substring(s.length() / 2); } }
Code Hunt 06.07
[code=language-java]public class Program { public static String Puzzle(String s) { int mid = s.length() / 2; return s.substring(mid + 1).toUpperCase() + s.substring(mid); } }
Code Hunt 06.08
[code=language-java]public class Program { public static int Puzzle(String a, String b) { return a.length() > b.length() ? a.length() : b.length(); } }
Code Hunt 06.09
[code=language-java]public class Program { public static String Puzzle(String a, String b) { return a.length() == b.length() ? a + b : (a.length() > b.length() ? a : b); } }
Code Hunt 06.10
[code=language-java]public class Program { public static int Puzzle(String s) { return s.length() / 3; } }
Code Hunt 06.11
[code=language-java]public class Program { public static String Puzzle(int i, int j, String s) { return s.substring(i, s.length() - 1) + s.substring(j, s.length() - 1); } }
Code Hunt 06.12
一星解法:
[code=language-java]public class Program { public static String Puzzle(String s) { return s + new StringBuffer(s).reverse(); } }
三星解法(令人无语):
[code=language-java]public class Program { public static String Puzzle(String s) { return s + s.charAt(1) + s.charAt(0); } }
相关文章推荐
- 【CodeHunt】噢,听说今年的CH又开始了
- Code Hunt Sector 07 Strings 2 - Java
- Code Hunt Sector 08 Nested Loops - Java
- Code Hunt Sector 09 1D Arrays - Java
- Code Hunt Sector 14 Puzzles - Java
- Code Hunt Sector 13 Cyphers - Java
- Code Hunt Sector 12 Search Sort - Java
- Code Hunt Sector 11 Arrays 2 - Java
- Code Hunt Sector 10 Jagged Arrays - Java
- Code Hunt Sector 05 Conditionals 2 - Java
- Code Hunt Sector 04 Conditionals - Java
- Code Hunt Sector 03 Loops 2 - Java
- Code Hunt Sector 02 Loops - Java
- Code Hunt Sector 01 Arithmetic - Java
- Code Hunt Sector 00 Training - Java
- Java解析XML文件两种方式
- 二、基础内容:字符、数据类型、运算符和数组