10 2016 档案
摘要：Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l
阅读全文
摘要：Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example:Given a = 1 and b = 2, return 3. java:
阅读全文
摘要：Given an array of integers, every element appears twice except for one. Find that single one. Bit Manipulation: C++: java（1ms）：
阅读全文
摘要：You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 ston
阅读全文
摘要：Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should output “Fizz” instead of the numbe
阅读全文
摘要：Write a function that takes a string as input and returns the string reversed. Example:Given s = "hello", return "olleh". Java(3ms): C++(9ms): C++(9ms
阅读全文
