Backpack VI
Description:
Given an integer array nums with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.
Notice
Coins in a Line II
Description:
There are n coins with different value in a line. Two players take turns to take one or two coins from left side until there are no more coins left. The player who take the coins with the most value wins. Could you please decide the first player will win or lose?
Example:
Binary Tree Maximum Path Sum
Description:
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree.
Example:
Restore IP Addresses
Description:
Given a string containing only digits, restore it by returning all possible valid IP address combinations.
Example
Palindrome Partitioning
Description:
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
Example
Median Of Two Sorted Arrays
Description:
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays.
Example
Given A=[1,2,3,4,5,6] and B=[2,3,4,5], the median is 3.5. Given A=[1,2,3] and B=[4,5], the median
HihoCoder1054
描述
滑动解锁是智能手机一项常用的功能。你需要在3x3的点阵上，从任意一个点开始，反复移动到一个尚未经过的”相邻”的点。这些划过的点所组成的有向折线，如果与预设的折线在图案、方向上都一致，那么手机将解锁。两个点相邻当且仅当以这两个点为端点的线段上不存在尚未经过的点。此外，这条折线还需要至少经过4个点。为了描述方便，我们给这9个点从上到下、从左到右依次编号1-9。那么1->2->3是不合法的，因为长度不足。1->3->2->4也是合不法的，因为1->3穿过了尚未经
Median
Description:
Given a unsorted array with integers, find the median of it.
A median is the middle number of the array after it is sorted.
If there are even numbers in the array, return the N/2-th number after sorted.
Counting Islands II
Description:
Counting Islands II
Binary Tree Level Order Traversal II
Description:
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).
Example
Given binary tree {3,9,20,#,#,15,7},