摘要：
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible roote 阅读全文
posted @ 2017-12-07 11:35
逸朵
阅读(148)
评论(0)
推荐(0)
摘要：
Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest inc 阅读全文
posted @ 2017-12-07 08:14
逸朵
阅读(101)
评论(0)
推荐(0)
摘要：
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or 阅读全文
posted @ 2017-12-07 07:24
逸朵
阅读(157)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2017-12-07 05:42
逸朵
阅读(130)
评论(0)
推荐(0)
摘要：
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a lette 阅读全文
posted @ 2017-12-07 05:20
逸朵
阅读(132)
评论(0)
推荐(0)
摘要：
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, giv 阅读全文
posted @ 2017-12-07 04:16
逸朵
阅读(93)
评论(0)
推荐(0)
摘要：
Given a string that contains only digits 0-9 and a target value, return all possibilities to add binary operators (not unary) +, -, or *between the di 阅读全文
posted @ 2017-12-07 04:02
逸朵
阅读(105)
评论(0)
推荐(0)
摘要：
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. For example, given n = 12, 阅读全文
posted @ 2017-12-07 03:05
逸朵
阅读(103)
评论(0)
推荐(0)
摘要：
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c 阅读全文
posted @ 2017-12-07 02:48
逸朵
阅读(96)
评论(0)
推荐(0)
摘要：
Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm? 阅读全文
posted @ 2017-12-07 02:44
逸朵
阅读(114)
评论(0)
推荐(0)
摘要：
Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. According 阅读全文
posted @ 2017-12-07 02:40
逸朵
阅读(157)
评论(0)
推荐(0)
摘要：
Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. For example, 123 -> "One Hundre 阅读全文
posted @ 2017-12-07 01:59
逸朵
阅读(118)
评论(0)
推荐(0)
浙公网安备 33010602011771号