Code_KK的博客

前半生写过的最复杂的JAVA 代码，感觉自己萌萌哒（java 大数就是 daio）                                                                                                                                Catch That Cow Time L

Problem Description ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is

Problem Description MZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n) The xor of an array B is defined as B1 xor B2...xor Bn In

剑指Offier——跳台阶 题目描述 一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。 public class Solution { public int JumpFloor(int target) { if(target ==1){ return 1; } else if(targe