-
编辑 删除
Lintcode137 Clone Graph solution 题解
【题目描述】Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.How we serialize an undirected graph:Nodes are labeled uniquely.We use#as a separator for each node, and,as a separator for node label an...
-
编辑 删除
Lintcode136 Palindrome Partitioning solution 题解
【题目描述】Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.给定一个字符串s，将s分割成一些子串，使每个子串都是回文串。【题目链接】www.lintcode.com/en/prob...
-
编辑 删除
Lintcode135 Combination Sum solution 题解
【题目描述】Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited number of times.Notice...
-
编辑 删除
Lintcode134 Lru Cache solution 题解
【题目描述】Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.set(key, value...
-
编辑 删除
Lintcode133 Longest Words solution 题解
【题目描述】Given a dictionary, find all of the longest words in the dictionary.给一个词典，找出其中所有最长的单词。【题目链接】www.lintcode.com/en/problem/longest-words/【题目解析】容易想到的是首先遍历一次，找到最长的字...
-
编辑 删除
2017校招常考算法题归纳&典型题目汇总
017校招即将来临，我们为大家整理了2017校招的常考算法类型，以及对应的典型题目。另附参考答案地址：http://www.jiuzhang.com/solution/数学尾部的零斐波纳契数列x的平方根x的平方根 2大整数乘法骰子求和最多有多少个点在一条直线上超级丑数比特位操作将整数A转换为B更新二进制位二进制表示O(1)...
-
编辑 删除
Lintcode132 Word Search || solution 题解
【题目描述】Given a matrix of lower alphabetsand a dictionary.Find all words in the dictionary that can be found in the matrix. A word can start from any position in the matrix and go left/right/up/down to the adjacent position.给出一个由小写字母组成的矩阵和一个字典。找出所...
-
编辑 删除
Lintcode131 Building Outline solution 题解
【题目描述】GivenNbuildings in a x-axis，each building is a rectangle and can be represented by a triple (start, end, height)，where start is the start position on x-axis, end is the end position on x-axis and height is the height of the building. Buildings may overlap if you see ...
-
编辑 删除
Google software engineer onsite面经
面试官上来先是让我进行了自我介绍，让我说说自己的强项。然后让我谈谈之前的项目经历和亮点，因为之前做过的项目基本上都是在有人指导的情况下完成的，所以这个答得不太好，感觉面试官也不太满意。后面就问了算法题。Lintcode 原题地址：http://www.lintcode.com/zh-cn/problem/maximal-rectangle/算法题目都比...
