摘要: An abbreviation of a word follows the form . Below are some examples of word abbreviations: a) it --> it (no abbreviation) 1 b) d|o|g --> d1g 1 1 1 1 阅读全文
posted @ 2017-07-18 06:44 Review->Improve 阅读(509) 评论(0) 推荐(0) 编辑
摘要: Given an interval list which are flying and landing time of the flight. How many airplanes are on the sky at most? If landing and flying happens at th 阅读全文
posted @ 2017-07-15 06:39 Review->Improve 阅读(875) 评论(0) 推荐(0) 编辑
摘要: Given a non-overlapping interval list which is sorted by start point. Insert a new interval into it, make sure the list is still in order and non-over 阅读全文
posted @ 2017-07-14 13:32 Review->Improve 阅读(201) 评论(0) 推荐(0) 编辑
摘要: The API: int read4(char *buf) reads 4 characters at a time from a file. The return value is the actual number of characters read. For example, it retu 阅读全文
posted @ 2017-07-14 12:42 Review->Improve 阅读(316) 评论(0) 推荐(0) 编辑
摘要: Given a binary search tree and a new tree node, insert the node into the tree. You should keep the tree still be a valid binary search tree. You can a 阅读全文
posted @ 2017-07-14 11:45 Review->Improve 阅读(250) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only 阅读全文
posted @ 2017-06-30 23:23 Review->Improve 阅读(374) 评论(0) 推荐(0) 编辑
摘要: Given a collection of intervals, merge all overlapping intervals. Given a collection of intervals, merge all overlapping intervals. Given a collection 阅读全文
posted @ 2017-06-30 06:11 Review->Improve 阅读(296) 评论(0) 推荐(0) 编辑
摘要: Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. Given a string containing just 阅读全文
posted @ 2017-06-24 01:29 Review->Improve 阅读(226) 评论(0) 推荐(0) 编辑
摘要: Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Given a string, find the first non 阅读全文
posted @ 2017-06-23 01:13 Review->Improve 阅读(707) 评论(0) 推荐(0) 编辑
摘要: Given an integer, convert it to a roman numeral. The number is guaranteed to be within the range from 1 to 3999. Given an integer, convert it to a rom 阅读全文
posted @ 2017-06-23 00:50 Review->Improve 阅读(167) 评论(0) 推荐(0) 编辑