2017年7月14日
[LintCode] Insert Interval
摘要： 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) 编辑
[LintCode] Read Characters From File - Multiple Calls
摘要： 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) 编辑
[LintCode] Insert Node in a Binary Search Tree
摘要： 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 阅读(249) 评论(0) 推荐(0) 编辑
2017年6月30日
[LintCode] Validate Binary Search Tree
摘要： 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) 编辑
[LintCode] Merge Intervals
摘要： 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) 编辑
2017年6月24日
[LintCode] Valid Parentheses
摘要： 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) 编辑
2017年6月23日
[LintCode] First Position Unique Character
摘要： 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) 编辑
[LintCode] Integer to Roman
摘要： 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) 编辑
[LintCode] Roman to Integer
摘要： Given a roman numeral, convert it to an integer. The answer is guaranteed to be within the range from 1 to 3999. Given a roman numeral, convert it to 阅读全文
posted @ 2017-06-23 00:33 Review->Improve 阅读(174) 评论(0) 推荐(0) 编辑
2017年6月21日
[LintCode] Jump Game II
摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-06-21 14:40 Review->Improve 阅读(459) 评论(0) 推荐(0) 编辑