panini - 博客园

2017年4月25日

摘要：题目： A robot is located at the top-left corner of a m x ngrid (marked 'Start' in the diagram below). The robot can only move either down or right at an 阅读全文

posted @ 2017-04-25 10:03 panini 阅读(119) 评论(0) 推荐(0) 编辑

117. Populating Next Right Pointers in Each Node II

摘要：题目： Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution 阅读全文

posted @ 2017-04-25 10:03 panini 阅读(132) 评论(0) 推荐(0) 编辑

116. Populating Next Right Pointers in Each Node

摘要：题目： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to it 阅读全文

posted @ 2017-04-25 10:03 panini 阅读(96) 评论(0) 推荐(0) 编辑

138. Copy List with Random Pointer

摘要：题目： A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep 阅读全文

posted @ 2017-04-25 10:03 panini 阅读(453) 评论(0) 推荐(0) 编辑

78. Subsets

摘要：题目： Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example,If num 阅读全文

posted @ 2017-04-25 10:02 panini 阅读(295) 评论(0) 推荐(0) 编辑

04/24/2017 Microsoft 电话面试

该文被密码保护。阅读全文

posted @ 2017-04-25 10:01 panini 阅读(3) 评论(0) 推荐(0) 编辑

2017年4月24日

[LintCode] 447 Search in a Big Sorted Array

摘要： DescriptionGiven a big sorted array with positive integers sorted by ascending order. The array is so big so that you can not get the length of the wh 阅读全文

posted @ 2017-04-24 08:50 panini 阅读(457) 评论(1) 推荐(0) 编辑

[LintCode] 585 Maximum Number in Mountain Sequence

摘要： 4/23/2017 算法班注意返回的是值，而不是index 阅读全文

posted @ 2017-04-24 08:40 panini 阅读(460) 评论(0) 推荐(0) 编辑

[LintCode] Search a 2D Matrix

摘要： 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 f 阅读全文

posted @ 2017-04-24 08:27 panini 阅读(172) 评论(0) 推荐(0) 编辑

[LintCode] 459 Closest Number in Sorted Array

摘要： DescriptionGiven a target number and an integer array A sorted in ascending order, find the index i in A such that A[i] is closest to the given target 阅读全文

posted @ 2017-04-24 08:11 panini 阅读(533) 评论(0) 推荐(0) 编辑

公告