code hunt 题解四(java 版)
来源:互联网 发布:深圳华夏软件职业教育 编辑:程序博客网 时间:2024/05/19 00:43
03.01 这个貌似要写成递归才会有3星
public class Program { public static int Puzzle(int number, int power) { return power<=0 ? 1 : number*Puzzle(number, power-1); }}
03.02
public class Program { public static int Puzzle(int i) { return i == 0?1:i*Puzzle(i-1); }}
public class Program { public static int Puzzle(int lowerBound, int upperBound) { return lowerBound>upperBound? 1 :lowerBound*Puzzle(lowerBound+1, upperBound); }}
03.04
public class Program { public static int Puzzle(int n) { if (n <= 2) { return 0; } return ((n-1)/2)*((n-1)/2+1); }}
03.05
public class Program { public static int Puzzle(int upperBound) { return (upperBound)*(upperBound+1)*(upperBound+2)/6; }}
03.06
public class Program { public static String Puzzle(String word) { return word.replaceAll("[a-z]", "_ ").trim(); }}
03.07 凯撒密码
public class Program { public static String Puzzle(String s) { char[] c = s.toCharArray(); for (int i = 0; i < s.length(); i++) { c[i] = (char)((c[i]-'a'+5)%26 + 'a'); } return new String(c); }}
03.08
public class Program { public static int Puzzle(int x) { return (x+"").length(); }}
0 0
- code hunt 题解四(java 版)
- code hunt 题解一 (java 版)
- code hunt 题解二(java版)
- code hunt 题解三 (java版)
- code hunt 题解五(java 版)
- code hunt 题解六(java版)
- code hunt 题解七(java版)
- code hunt 题解八(java版)
- Code Hunt 题解 00-04 (Java)
- Code Hunt 题解 05-08 (Java)
- Code Hunt 题解 09-12 (Java)
- Code Hunt (Microsoft Research)
- Code Hunt Sector02
- code hunt JAVA01
- code hunt JAVA02
- Code Hunt SECTOR 02 LOOPS
- 微软Code Hunt答案(00-05)——沉迷娱乐的我
- 程序员的游戏——Code Hunt
- Nodejs 异步框架async
- 如何自动获取网页页面元素的xpath(基于火狐浏览器)
- 用递归实现整数的各数字之和
- oracle02
- layoutSubviews在什么时候调用
- code hunt 题解四(java 版)
- Shell基础-环境变量配置文件-作用
- CLOUDSTACK FOR HYPER-V
- PHP解惑---数组
- 解题报告 之 SOJ3191 Free square
- 3.Socket网络编程之基于UDP协议的Socket(图解与源码)
- 记录关于spring MVC入门遇见的问题
- Leetcode Reorder List 链表重排序
- Freemarker指令