jycynb-CSDN博客

转载 Twitter SDE 波士顿电面面经

我先是向twitter投了简历，后面收到线上编程测试的通知。一个小时完成两道难度不高的编程题还是挺容易的。唯一有一点儿想吐槽的就是twitter官方要求使用的编辑器功能较弱。在当天晚上收到了线上编程测试通过的通知，然后约了第二天下午两点进行电面。电面1:早上8点我就开始为面试做准备。仔细回顾了一下之前在lintcode 上有标记的题、在本子上整理过的计算机知识重点。下午两点准时接到电面电话。先是和

2017-11-22 09:40:02 250

转载 Lintcode76 Longest Increasing Subsequence solution 题解

【题目描述】Given a sequence of integers, find the longest increasing subsequence (LIS).You code should return the length of the LIS.给定一个整数序列，找到最长上升子序列（LIS），返回LIS的长度。【说明】：最长上升子序列的定义：最长上升子序列问题是在一个无序的给定序列中找到一

2017-11-19 23:53:19 115

转载 Lintcode75 Find Peak Element solution 题解

【题目描述】There is an integer array which has the following features:·The numbers in adjacent positions are different.·A[0] A[A.length - 1].We define a position P is a peek if:A[P]>A[P-1]&&A[p]>A[P+1]Fin

2017-11-18 08:13:08 150

转载 Lintcode 74 First Bad Version solution 题解

【题目描述】The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the following versions are all failed in the unit

2017-11-17 23:07:56 105

转载 Lintcode73 Construct Binary Tree from Preorder and Inorder Traversal solution 题解

【题目描述】Given preorder and inorder traversal of a tree, construct the binary tree.Notice:You may assume that duplicates do not exist in the tree.根据前序遍历和中序遍历树构造二叉树.注意：你可以假设树中不存在相同数值的节点【题目链接】www.lintcode.

2017-11-16 22:30:40 129

转载 Lintcode72 Construct Binary Tree from Inorder and Postorder Traversal solution 题解

【题目描述】Given inorder and postorder traversal of a tree, construct the binary tree.Notice:You may assume that duplicates do not exist in the tree.根据中序遍历和后序遍历树构造二叉树注意:你可以假设树中不存在相同数值的节点【题目链接】www.lintcode.

2017-11-15 22:45:09 109

转载 Google SDE 面经

我面试的岗位是Google的Software Development Engineer。整体面试效率太低，面试结束一个月才被通知没通过，挺气的，忍不住吐槽效率太低。 1.LintCode - 寻找峰值。给定一个无重复整数的数组，首先增加然后减少。查找其中的最大数字。 LintCode原题链接：http://www.lintcode.com/zh-cn/problem/find-peak-e

2017-11-12 22:03:28 1123

转载 Lintcode71 Binary Tree Zigzag Level Order Traversal solution 题解

【题目描述】Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).给出一棵二叉树，返回其节点值的锯齿形层次遍历（先从

2017-11-11 10:08:24 99

转载 Lintcode70 Binary Tree Level Order Traversal II solution 题解

【题目描述】Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).给出一棵二叉树，返回其节点值从底向上的层次序遍历（按从叶节点所在层到根节点所在的层遍历，然后逐层从

2017-11-10 13:59:16 88

转载 Lintcode69 Binary Tree Level Order Traversal solution 题解

【题目描述】Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).给出一棵二叉树，返回其节点值的层次遍历（逐层从左往右访问）【题目链接】www.lintcode.com/en/problem/binary-tree-

2017-11-09 10:16:11 103

转载 Lintcode68 Binary Tree Postorder Traversal solution 题解

【题目描述】Given a binary tree, return the postorder traversal of its nodes' values.给出一棵二叉树，返回其节点值的后序遍历。【题目链接】www.lintcode.com/en/problem/binary-tree-postorder-traversal/ 【题目解析】二叉树后序遍历。刚接触leetcode时也做过这道

2017-11-08 08:16:47 114

转载 Lintcode67 Binary Tree Inorder Traversal solution 题解

【题目描述】Given a binary tree, return the inorder traversal of its nodes' values.给出一棵二叉树,返回其中序遍历【题目链接】www.lintcode.com/en/problem/binary-tree-inorder-traversal/ 【题目解析】递归版最好理解，递归调用时注意返回值和递归左右子树的顺序即可。迭代版

2017-11-07 11:32:51 147

原创新鲜出炉的迅雷面经

校园宣讲迅雷的校园招聘一般来的很早，看了宣传后比较想试试，于是在9月份的时候便通过网申投了一次，但是之后一直没有回音，于是没走官方渠道，通过几个应聘网站又投了一次，再次证明一个事实：可能我的简历真的不行，所以HR没看见或者直接忽略掉了。之后看到了迅雷的校园宣讲会安排，正好十月下旬是在我们学校，但是我临近时间才发现，宣讲会的时间和我们教授给我们的开题辅导正好冲突，所以干脆打印了一份简历

2017-05-27 14:23:45 1099

jycynb的博客