程序媛詹妮弗

2018年6月2日

[leetcode]117. Populating Next Right Pointers in Each NodeII用next填充同层相邻节点

摘要： Given a binary tree Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL 阅读全文

posted @ 2018-06-02 08:55 程序媛詹妮弗阅读(119) 评论(0) 推荐(0)

2018年5月31日

[leetcode]199. Binary Tree Right Side View二叉树右侧视角

摘要： Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 阅读全文

posted @ 2018-05-31 08:37 程序媛詹妮弗阅读(251) 评论(0) 推荐(0)

[leetcode]403. Frog Jump青蛙过河

摘要： A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but i 阅读全文

posted @ 2018-05-31 07:10 程序媛詹妮弗阅读(1062) 评论(0) 推荐(0)

2018年5月30日

[leetcode]265. Paint House II粉刷房子(K色可选)

摘要： There are a row of n houses, each house can be painted with one of the k colors. The cost of painting each house with a certain color is different. Yo 阅读全文

posted @ 2018-05-30 07:18 程序媛詹妮弗阅读(395) 评论(0) 推荐(0)

[leetcode]256. Paint House粉刷房子(三色可选)

摘要： There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certai 阅读全文

posted @ 2018-05-30 06:00 程序媛詹妮弗阅读(305) 评论(0) 推荐(0)

[leetcode]95. Unique Binary Search Trees II给定节点形成不同BST的集合

摘要： Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n. 题意：给定n个节点，列举可形成的不同的BST集合思路：跟 [leetcode] 阅读全文

posted @ 2018-05-30 05:07 程序媛詹妮弗阅读(201) 评论(0) 推荐(0)

[leetcode]96. Unique Binary Search Trees给定节点形成不同BST的个数

摘要： Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n? Input: 3 Output: 5 Explanation: Given n = 3, there are a 阅读全文

posted @ 2018-05-30 04:50 程序媛詹妮弗阅读(342) 评论(0) 推荐(0)

2018年5月26日

[leetcode]496. Next Greater Element I下一个较大元素

摘要： You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1' 阅读全文

posted @ 2018-05-26 03:32 程序媛詹妮弗阅读(193) 评论(0) 推荐(0)

2018年5月25日

[leetcode]632. Smallest Range最小范围

摘要： You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists. We define 阅读全文

posted @ 2018-05-25 04:28 程序媛詹妮弗阅读(846) 评论(0) 推荐(1)

理解数据结构Priority Queue

摘要：我们知道Queue是遵循先进先出（First-In-First-Out）模式的，但有些时候需要在Queue中基于优先级处理对象。举个例子，比方说我们有一个每日交易时段生成股票报告的应用程序，需要处理大量数据并且花费很多处理时间。客户向这个应用程序发送请求时，实际上就进入了队列。我们需要首先处理优先客阅读全文

posted @ 2018-05-25 01:21 程序媛詹妮弗阅读(556) 评论(0) 推荐(0)