yuanfangyuanfang0-CSDN博客

转载 Lintcode179 Update Bits solution 题解

【题目描述】 Given two 32-bit numbers,N and M, and two bit positions,i and j. Write a method to set all bits between i and j in N equal to M(e g ,M becomes a substring of N located at i and starting at j)

2017-12-18 21:21:28 199

转载 Lintcode178 Graph Valid Tree solution 题解

【题目描述】 Givennnodes labeled from0ton - 1and a list ofundirectededges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.【注】You can assume that no duplica

2017-12-18 14:53:42 226

转载 Lintcode177 Convert Sorted Array to Binary Search Tree With Minimal Height solution 题解

【题目描述】 Given a sorted (increasing order) array, Convert it to create a binary tree with minimal height.【注】There may exist multiple valid solutions, return any of them.给一个排序数组（从小到大），将其转换为一棵高度最小的排序二叉树。【

2017-12-17 08:52:49 168

转载 Lintcode176 Route Between Two Nodes in Graph solution 题解

【题目描述】 Given a directed graph, design an algorithm to find out whether there is a route between two nodes.给出一张有向图，设计一个算法判断两个点s与t之间是否存在路线。【题目链接】www.lintcode.com/en/problem/route-between-two-nodes-in-g

2017-12-16 19:20:29 145

转载 Lintcode175 Invert Binary Tree solution 题解

【题目描述】 Invert a binary tree. 翻转一棵二叉树。【题目链接】www.lintcode.com/en/problem/invert-binary-tree/【题目解析】用递归实现二叉树的翻转。递归出口为当结点为空时，返回NULL。否则对左右子树进行递归翻转，之后对翻转完成的左右子树的位置进行交换即可。【参考答案】www.jiuzhang.com/solutions/in

2017-12-14 18:23:28 131

转载 TWITTER SDE 电面+ONSITE 面经

在之前的公司干了两年多，想要寻求新的挑战，所以两个月前向Twitter投了简历。半个月后得到Twitter的反馈，然后开始了为期一周的面试。这次面试一共经历三轮电面和七轮onsite。中间各种忐忑，但好在最后拿到了offer，也算没有白费力气。电面1: 首先面试官做了简单的自我介绍，然后问了之前做过的项目的基本内容。之后就进行了coding。 1.斐波纳契系列不使用数组 -

2017-12-13 17:06:53 382

yuanfangyuanfang0的博客