cchengone的博客

题目：Reverse StringWrite a function that takes a string as input and returns the string reversed. Example: Given s = “hello”, return “olleh”. 答案：public class Solution { public String reverseString(

题目：Ransom Note描述：Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from th

题目：Delete Node in a linked List描述：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 -> 4 and you are

题目：Sum of Leaves描述：Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7There are two left leaves in the binary tree, with values 9 and 15 resp

题目：Move Zeroes描述：Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1, 0, 3, 12], afte

题目：Invert Binary Tree描述：invert binary tree: 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1翻译：将二叉树的左边和右边进行置换答案：/** * Definition for a b

题目:Excel Sheet Column Number描述：Given a column title as appear in an Excel sheet, return its corresponding column number. For example: A -> 1 B -> 2 C -> 3 … Z -> 26 AA ->

题目:First Unique Character in a String描述：Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1. Examples: s = “leetcode”  –> return 0;s =

题目：Maximum Depth of Binary Tree题目详情: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 leaf node.翻译：有一

题目：Single Number题目详情:Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it

题目：Fizz Buzz题目详情: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 number and for the multiples of five o

Find All Numbers Disappeared in an Array描述：Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusi