轻风舞动

2018年10月5日

摘要： This question is about implementing a basic elimination algorithm for Candy Crush. Given a 2D integer array board representing the grid of candy, diff 阅读全文

posted @ 2018-10-05 09:24 轻风舞动阅读(1533) 评论(0) 推荐(0) 编辑

Convex Hull | Set 1

摘要： Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it. https://www.geeksfor 阅读全文

posted @ 2018-10-05 05:08 轻风舞动阅读(499) 评论(0) 推荐(0) 编辑

[CareerCup] Single Valid Tree

摘要： https://www.careercup.com/question?id=5103530547347456 Given a list of nodes, each with a left child and a right child (they can be null), determine i 阅读全文

posted @ 2018-10-05 05:05 轻风舞动阅读(296) 评论(0) 推荐(0) 编辑

2018年10月4日

Find minimum number of people to reach to spread a message across all people in twitter

摘要： Considering that I'ld would like to spread a promotion message across all people in twitter. Assuming the ideal case, if a person tweets a message, th 阅读全文

posted @ 2018-10-04 08:23 轻风舞动阅读(277) 评论(0) 推荐(0) 编辑

[LeetCode] 658. Find K Closest Elements 寻找K个最近元素

摘要： Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If the 阅读全文

posted @ 2018-10-04 04:51 轻风舞动阅读(604) 评论(0) 推荐(0) 编辑

2018年10月3日

[LeetCode] 382. Linked List Random Node 链表随机节点

摘要： Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen. Follow up:Wha 阅读全文

posted @ 2018-10-03 09:39 轻风舞动阅读(523) 评论(0) 推荐(0) 编辑

[LeetCode] 384. Shuffle an Array 数组洗牌

摘要： Shuffle a set of numbers without duplicates. Example: 给一个没有重复数字的数组，实现重置和洗牌的功能。解法：遍历数组每个位置，每次都随机生成一个坐标位置，然后交换当前位置和随机位置的数字，这样如果数组有n个数字，那么也随机交换了n组位置，从而达阅读全文

posted @ 2018-10-03 09:28 轻风舞动阅读(732) 评论(0) 推荐(0) 编辑

[LeetCode] 489. Robot Room Cleaner 扫地机器人

摘要： Given a robot cleaner in a room modeled as a grid. Each cell in the grid can be empty or blocked. The robot cleaner with 4 given APIs can move forward 阅读全文

posted @ 2018-10-03 09:17 轻风舞动阅读(4999) 评论(0) 推荐(0) 编辑

[LeetCode] 465. Optimal Account Balancing 最优账户平衡

摘要： A group of friends went on holiday and sometimes lent each other money. For example, Alice paid for Bill's lunch for 10.ThenlaterChrisgaveAlice10.Then 阅读全文

posted @ 2018-10-03 08:41 轻风舞动阅读(1897) 评论(0) 推荐(0) 编辑

[LeetCode] 106. Construct Binary Tree from Inorder and Postorder Traversal 由中序和后序遍历建立二叉树

摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文

posted @ 2018-10-03 07:05 轻风舞动阅读(237) 评论(0) 推荐(0) 编辑

公告