09 2018 档案

[LeetCode] 470. Implement Rand10() Using Rand7() 使用Rand7()来实现Rand10()
摘要：Given a function rand7 which generates a uniform random integer in the range 1 to 7, write a function rand10 which generates a uniform random integer 阅读全文
posted @ 2018-09-30 00:00 Grandyang 阅读(7328) 评论(0) 推荐(1) 编辑
[LeetCode] 430. Flatten a Multilevel Doubly Linked List 压平一个多层的双向链表
摘要：You are given a doubly linked list which in addition to the next and previous pointers, it could have a child pointer, which may or may not point to a 阅读全文
posted @ 2018-09-21 21:24 Grandyang 阅读(6164) 评论(5) 推荐(0) 编辑
[LeetCode] N-ary Tree Level Order Traversal N叉树层序遍历
摘要：Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example, given a 3-ary tree: 阅读全文
posted @ 2018-09-18 23:59 Grandyang 阅读(3658) 评论(0) 推荐(0) 编辑
[LeetCode] Construct Quad Tree 建立四叉树
摘要：We want to use quad trees to store an N x N boolean grid. Each cell in the grid can only be true or false. The root node represents the whole grid. Fo 阅读全文
posted @ 2018-09-14 22:46 Grandyang 阅读(5411) 评论(0) 推荐(0) 编辑
[LeetCode] 426. Convert Binary Search Tree to Sorted Doubly Linked List 将二叉搜索树转为有序双向链表
摘要：Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers i 阅读全文
posted @ 2018-09-09 23:34 Grandyang 阅读(11262) 评论(1) 推荐(1) 编辑
[LeetCode] 817. Linked List Components 链表组件
摘要：You are given the head of a linked list containing unique integer values and an integer array nums that is a subset of the linked list values. Return  阅读全文
posted @ 2018-09-06 21:56 Grandyang 阅读(6523) 评论(0) 推荐(1) 编辑

Fork me on GitHub