随笔分类 -  LintCode

摘要: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 阅读(910) 评论(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 阅读(214) 评论(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 阅读(322) 评论(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 阅读(264) 评论(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 阅读(389) 评论(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 阅读(304) 评论(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 阅读(233) 评论(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 阅读(172) 评论(0) 推荐(0)
摘要: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 阅读(183) 评论(0) 推荐(0)
摘要: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 阅读(470) 评论(0) 推荐(0)
摘要: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 13:22 Review->Improve 阅读(387) 评论(0) 推荐(0)
摘要:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Given a m x n matrix, if an element is 0, set its entire 阅读全文
posted @ 2017-06-21 00:35 Review->Improve 阅读(187) 评论(0) 推荐(0)
摘要:Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have 阅读全文
posted @ 2017-06-20 05:26 Review->Improve 阅读(247) 评论(0) 推荐(0)
摘要:There is a stone game.At the beginning of the game the player picks n piles of stones in a line. The goal is to merge the stones in one pile observing 阅读全文
posted @ 2017-06-06 09:02 Review->Improve 阅读(1267) 评论(0) 推荐(0)
摘要:Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrenc 阅读全文
posted @ 2017-06-05 05:35 Review->Improve 阅读(1089) 评论(0) 推荐(0)
摘要:Write a function that add two numbers A and B. You should not use + or any arithmetic operators. There is no need to read data from standard input str 阅读全文
posted @ 2017-06-01 12:56 Review->Improve 阅读(224) 评论(0) 推荐(0)