coderer的博客_51CTO博客

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

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

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 665 阅读

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 810 阅读

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 483 阅读

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 517 阅读

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 423 阅读

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 521 阅读

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 485 阅读

Lintcode9 Fizz Buzz solution 题解

【题目描述】Given number n. Print number from 1 to n. But:when number is divided by 3, print "fizz".when number is divided by 5, print "buzz".when number is divided by both 3 and 5, print "fizz buzz".给你一个整数

技能

number

solution

原创 2017-04-19 22:41:30 664 阅读

Lintcode8 Rotate String solution 题解

【题目描述】Given a string and an offset, rotate string by offset. (rotate from left to right)给定一个字符串和一个偏移量，根据偏移量旋转字符串(从左向右旋转)【题目链接】http://www.lintcode.com/en/problem/rotate-string/【题目解析】常见的翻转法应用题，仔细观察规律可知翻

Problem

A+B

lintcode1

原创 2017-04-19 08:28:32 723 阅读

Lintcode7 Binary Tree Serialization solution 题解

【题目描述】Design an algorithm and write code to serialize and deserialize a binary tree. Writing the tree to a file is called 'serialization' and reading back from the file to reconstruct the exact same b

Design

solution

reading

转载 2017-04-17 22:09:15 504 阅读

Lintcode6 Merge Two Sorted Arrays solution 题解

【题目描述】Merge two given sorted integer array A and B into a new sorted integer array.合并两个排序的整数数组A和B变成一个新的数组。【题目链接】http://www.lintcode.com/en/problem/merge-two-sorted-arrays/【题目解析】A和B都已经是排好序的数组，我们只需要从后往前

空间

solution

原创 2017-04-15 22:37:16 508 阅读

Lintcode5 Kth Largest Element solution 题解

【题目描述】Find K-th largest element in an array.Notice:You can swap elements in the array在数组中找到第k大的元素注意：你可以交换数组中的元素的位置【题目链接】http://www.lintcode.com/en/problem/kth-largest-element/【题目解析】sort的方法：一开始看到这道题肯定觉

solution

elements

complexity

原创 2017-04-13 12:29:03 555 阅读

Lintcode4 Ugly Number II solution 题解

【题目描述】Ugly number is a number that only have factors 2, 3 and 5.Design an algorithm to find the nth ugly number. The first 10 ugly numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12...Notice:Note that 1 is ty

solution

numbers

factors

原创 2017-04-11 08:54:41 602 阅读

Lintcode3 Digit Counts solution 题解

【题目描述】Count the number of k's between 0 and n. k can be 0 - 9.计算数字k在0到n中的出现的次数，k可能是0~9的一个值。【题目链接】http://www.lintcode.com/en/problem/digit-counts/【题目解析】方法一： Brute Force, 0到n个数挨个算过去。最大的问题就是效率，当n非常大时，就需要

number

solution

between

最大的

原创 2017-04-11 08:51:36 369 阅读

Lintcode3 Digit Counts solution 题解

【题目描述】Count the number of k's between 0 and n. k can be 0 - 9.计算数字k在0到n中的出现的次数，k可能是0~9的一个值。【题目链接】http://www.lintcode.com/en/problem/digit-counts/【题目解析】方法一： Brute Force, 0到n个数挨个算过去。最大的问题就是效率，当n非常大时，就需要

number

solution

between

原创 2017-04-09 20:23:11 469 阅读

Lintcode2 Trailing Zeros solution 题解

【题目描述】Write an algorithm which computes the number of trailing zeros in n factorial.设计一个算法，计算出n阶乘中尾部零的个数。【题目链接】http://www.lintcode.com/en/problem/trailing-zeros/【题目解析】传统解法是首先求出n!，然后计算末尾0的个数。（重复÷10，直到余

number

solution

原创 2017-04-08 13:03:59 585 阅读

Lintcode1 A+B Problem solution 题解

Problem

A+B

Lintcode1

原创 2017-04-07 19:22:44 460 阅读

Lintcode1 A+B Problem solution 题解

Problem

A+B

Lintcode1

原创 2017-04-07 19:22:33 445 阅读

Lintcode1 A+B Problem solution 题解

Problem

A+B

Lintcode1

原创 2017-04-07 16:19:05 423 阅读

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

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

51CTO博客

12789252