随笔分类 - lintcode
最新最好的刷题网站http://www.lintcode.com/
摘要:【题目描述】 Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers[start, end]. Fo
阅读全文
摘要:【题目描述】 Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers[start, end]. Fo
阅读全文
摘要:【题目描述】 For a Maximum Segment Tree, which each node has an extra value max to store the maximum value in this node's interval. Implement a modify funct
阅读全文
摘要:【题目描述】 For an integer array (index from 0 to n-1, where n is the size of this array), in the corresponding Segment Tree, each node stores an extra att
阅读全文
摘要:【题目描述】 Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of Sis 1000, and there exists one unique
阅读全文
摘要:【题目描述】 The structure of Segment Tree is a binary tree which each node has two attributes start and end denote an segment / interval. start and end are
阅读全文
摘要:为了能够顺利拿到offer,我做了很长时间的准备,在Lincode上刷题,报算法班,然后耗了一个多星期做了一份自己满意的简历。我的努力没有白费,最后我成功拿到Yahoo的offer,现已入职近半年。 我通过内推拿到的面试机会。面试时间是在去年十月份,onsite面试花了五个多小时。面试官很nice,
阅读全文
摘要:【题目描述】 Given a permutation which may contain repeated numbers, find its index in all the permutations of these numbers, which are ordered in lexicogra
阅读全文
摘要:【题目描述】 Given a permutation which contains no repeated number, find its index in all the permutations of these numbers, which are ordered in lexicograp
阅读全文

浙公网安备 33010602011771号