coderer的最近发布

欢迎

小米面经-技术岗（编程小白如何进阶）

先介绍下背景，我本科专业是硬件转软件方面，所以一开始算法基础比较差，没有做过系统设计，为了能得到好的面试机会，我一直都有努力准备，还在网上关注了各种能提高编程能力的攻略，我觉得打好基础的前提是要找到优质的学习资源，这样才能事半功倍，切忌在网上搜一些质量参差不齐的题去练习，有的连答案都不知道对不对，更别提对面试有帮助了。我对比了几家刷题的网站，最后选了Lintcode(http://www.lint

技术

自我介绍

面试官

如何

小伙伴

原创 2017-05-08 19:55:36 1726 阅读

Lintcode30 Insert Interval solution 题解

题目描述】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-overlapping (merge intervals if necessary).给出一个无重叠

start

solution

necessary

原创 2017-05-07 21:32:21 501 阅读

Lintcode29 Interleaving String solution 题解

【题目描述】Given three strings: s1, s2, s3, determine whether s3 is formed by the interleaving of s1 and s2.给出三个字符串:s1、s2、s3，判断s3是否由s1和s2交叉构成。【题目链接】http://www.lintcode.com/en/problem/interleaving-string/【题

参考答案

solution

determine

原创 2017-05-07 21:31:25 698 阅读

Lintcode28 Search a 2D Matrix solution 题解

【题目描述】Write an efficient algorithm that searches for a value in an m x n matrix.This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each ro

solution

Matrix

following

原创 2017-05-04 22:42:20 812 阅读

Lintcode24 LFU Cache solution 题解

【题目描述】LFU (Least Frequently Used) is a famous cache eviction algorithm.For a cache with capacity k, if the cache is full and need to evict a key in it, the key with the lease frequently used will be k

solution

capacity

Recently

原创 2017-05-04 22:40:28 849 阅读

Lintcode22 Flatten List solution 题解

【题目描述】Given a list, each element in the list can be a list or integer. flatten it into a simply list with integers.Notice：If the element in the given list is a list, it can contain list too.给定一个列表，该列表

参考答案

solution

contain

原创 2017-04-30 21:33:43 668 阅读

Lintcode20 Dices Sum solution 题解

【题目描述】Throw n dices, the sum of the dices' faces is S. Given n, find the all possible value of S along with its probability.Notice:You do not care about the accuracy of the result, we will help you to

solution

result

possible

原创 2017-04-30 21:32:25 1393 阅读

Lintcode18 Subsets II solution 题解

【题目描述】Given a list of numbers that may has duplicate numbers, return all possible subsetsNotice:Each element in a subset must be in non-descending order.The ordering between two subsets is free.The so

solution

between

possible

原创 2017-04-29 16:35:45 812 阅读

Lintcode17 Subsets solution 题解

【题目描述】Given a set of distinct integers, return all possible subsets.Notice:Elements in a subset must be in non-descending order;The solution set must not contain duplicate subsets.给定一个含不同整数的集合，返回其所有的子

solution

possible

contain

原创 2017-04-28 23:10:56 713 阅读

Lintcode16 Permutations II solution 题解

【题目描述】Given a list of numbers with duplicate number in it. Find all unique permutations.给出一个具有重复数字的列表，找出列表所有不同的排列。【题目链接】http://www.lintcode.com/en/problem/permutations-ii/【题目解析】跟 Permutations的解法一样，就是要

solution

numbers

原创 2017-04-27 22:38:39 486 阅读

Lintcode15 Permutations solution 题解

【题目描述】Given a list of numbers, return all possible permutations.Notice:You can assume that there is no duplicate numbers in the list.给定一个数字列表，返回其所有可能的排列。注意:你可以假设没有重复数字。【题目链接】http://www.lintcode.com/en

solution

numbers

possible

原创 2017-04-27 22:37:18 525 阅读

Lintcode14 First Position of Target Solution 题解

【题目描述】For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity.If the target number does not exist in the array, return -1.给定一个排序

number

return

position

原创 2017-04-25 17:21:43 426 阅读

Lintcode13 strStr solution 题解

【题目描述】For a given source string and a target string, you should output the first index(from 0) of target string in source string.If target does not exist in source, just return -1.对于一个给定的 source 字符串和一

软件测试

lintcode

原创 2017-04-25 17:19:41 526 阅读

Lintcode12 Min Stack solution 题解

题目描述】Implement a stack with min() function, which will return the smallest number in the stack.It should support push, pop and min operation all in O(1) cost.Notice:min operation will never be called

solution

operation

function

原创 2017-04-24 22:57:05 440 阅读

Lintcode11 Search Range in Binary Search Tree solution 题解

【题目描述】Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Find all the keys of tree in range k1 to k2. i.e. print all x such that k1<=x<=k2 and x is a key o

where

solution

values

原创 2017-04-21 14:16:08 484 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

12789252

欢迎

小米面经-技术岗（编程小白如何进阶）

Lintcode30 Insert Interval solution 题解

Lintcode29 Interleaving String solution 题解

Lintcode28 Search a 2D Matrix solution 题解

Lintcode24 LFU Cache solution 题解

Lintcode22 Flatten List solution 题解

Lintcode20 Dices Sum solution 题解

Lintcode18 Subsets II solution 题解

Lintcode17 Subsets solution 题解

Lintcode16 Permutations II solution 题解

Lintcode15 Permutations solution 题解

Lintcode14 First Position of Target Solution 题解

Lintcode13 strStr solution 题解

Lintcode12 Min Stack solution 题解

Lintcode11 Search Range in Binary Search Tree solution 题解