- 博客(6)
- 收藏
- 关注
RSS订阅转载 Lintcode149 Best Time to Buy and Sell Stock solution 题解
【题目描述】 Say you have an array for which theithelement is the price of a given stock on dayi. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the
2017-10-16 23:04:45
131
转载 Lintcode148 Sort Colors solution 题解
【题目描述】 Given an array with n objects colored red,white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the
2017-10-15 20:56:05
153
转载 Lintcode144 Interleaving Positive And Negative Numbers solution 题解
【题目描述】 Given an array with positive and negative integers. Re-range it to interleaving with positive and negative integers. Notice You are not necessary to keep the original order of positive i
2017-10-14 19:43:47
144
原创 Facebook SDE onsite面经
前不久参加了Facebook的SDE面试，很遗憾失败了，不过还是有些经验能分享的。 这次面试一共面试了4轮。 Onsite1 一面还比较顺利，先是让我进行了自我介绍，然后谈了谈之前的项目经历，后面就直接进行coding了。 1.电话号码排列 - 给定一个数字字符串，返回数字可能代表的所有可能的字母组合。 一面结束随后便被通知可以进行第二轮面试了。 Onsite2
2017-10-13 23:48:32
318
转载 Lintcode143 Sort Colors || solution 题解
【题目描述】 Given an array ofnobjects withkdifferent colors (numbered from 1 to k), sort them so that objects of the same color are adjacent, with the colors in the order 1, 2, ... k. Notice You are
2017-10-12 13:41:03
145
转载 Lintcode142 O(1) Check Power Of 2 solution 题解
【题目描述】 Using O(1) time to check whether an integernis a power of2. 用O(1) 时间检测整数n是否是2的幂次。 【题目链接】 www.lintcode.com/en/problem/o1-check-power-of-2/ 【题目解析】 简单点来考虑可以连除2求余，看最后的余数是否为1，但是这种方法无法在 O(1
2017-10-11 22:54:41
167
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人