摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文

摘要： Implement int sqrt(int x). Compute and return the square root of x. using only integer division for the Newton method works 阅读全文

摘要： Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100". 判断数字时用charAt(i)-'0'即可 阅读全文

摘要： Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leadin 阅读全文

摘要： Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word 阅读全文

摘要： http://blog.csdn.net/linhuanmars/article/category/2336231 阅读全文

摘要： java基础 JVM java并发 java集合 设计模式 Spring Mybatis MySQL Dubbo Redis ActiveMQ Zookeeper 阅读全文

摘要： leetcode好博文：http://blog.csdn.net/crazy1235/article/details/51420522 阅读全文

摘要： Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical a 阅读全文

摘要： Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 - 阅读全文