题目描述：
Write a program to check whether a given number is an ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since it ...
标签归档：leetcode
[LeetCode]Ugly Number
[LeetCode]Single Number III
作者是
发布于
在
LeetCode.
题目描述：
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
For example:
Given nums = [1, 2, 1, 3, 2 ...
[LeetCode]Word Ladder
作者是
发布于
在
LeetCode.
题目描述：
Given two words (beginWord and endWord), and a dictionary, find the length of shortest transformation sequence from beginWord to endWord, such that:
Only one letter can be changed at a time
Each intermediate word must exist in the dictionary ...
[LeetCode]Add Digits
作者是
发布于
在
LeetCode.
题目描述：
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
For example:
Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return ...
[LeetCode]Binary Tree Paths
作者是
发布于
在
LeetCode.
题目描述：
Given a binary tree, return all root-to-leaf paths.
For example, given the following binary tree:
1 / \ 2 3 \ 5
All root-to-leaf paths are:
["1->2->5", "1->3"]
题目大意：
给定一棵二叉树，返回所有“根到叶子”的路径。
例如，给定下面的二叉树：
1 / \ 2 3 \ 5
所有“根到叶子”路径为：
["1->2->5", "1->3"]
解题思路：
树的遍历 ...