GuoWwww-CSDN博客

原创 2017017（期末）

8.23. In the NODE-DISJOINT PATHS problem, the input is an undirected graph in which some vertices have been specially marked: a certain number of “sources” s1, s2, . . . sk and an equal number of “d

2017-07-11 21:33:16 410

原创 20177016

Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the same row and column, the order should be from left

2017-06-12 19:53:36 148

原创 2017015

[LeetCode] Palindrome Pairs Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j]

2017-06-06 11:05:41 150

原创 2017014

Palindrome Pairs 回文对 Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j] is a palindrom

2017-05-22 10:13:06 133

原创 2017013

Remove Duplicate Letters 移除重复字母 Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result is

2017-05-15 10:25:23 187

原创 2017012

[LeetCode] Flip Game 翻转游戏之二 You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and - , you and your friend take turns to flip

2017-05-08 19:45:22 153

原创 2017011

Burst Balloons 打气球游戏 Given n balloons, indexed from 0 to n-1 . Each balloon is painted with a number on it represented by array nums . You are asked to burst all the balloons. If the you

2017-05-01 16:35:13 233

原创 2017010

[LeetCode] Largest BST Subtree 最大的二分搜索子树 Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it. No

2017-04-24 17:10:22 152

原创 2017009

Given two sparse matrices A and B, return the result of AB. You may assume that A's column number is equal to B's row number. Example: A = [ [ 1, 0, 0], [-1, 0, 3] ] B = [ [ 7,

2017-04-17 12:21:15 153

原创 2017008

medium： Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected components in an undirected graph. Exa

2017-04-10 18:33:34 144

原创 2017007 (一次小实验)

今天带来的是学着开发最原始的操作系统（第一次尝试轻喷）硬件、软件及虚拟机配置如下笔记本电脑windows8.10 OracleVM VirtualBox OracleVM VirtualBox：创建虚拟机 NASM：汇编语言工具 Winlmage：映象文件浏览编辑 WinHex：二进制文件编辑工具 Bochs：调试工具首先进行引导程序（myos）的编写： org

2017-03-28 20:52:21 806 3

原创 2017006

House Robber III The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one pare

2017-03-27 11:57:52 153

原创 2017005

Note: This is an extension of House Robber. After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time

2017-03-27 11:39:54 134

原创 2017004

Today we will meet an interesting question:HOUSE ROBBER!!!! From LEETCODE 198.

2017-03-20 10:30:43 136

原创 2017003

Given a collection of distinct numbers, return all possible permutations.

2017-03-13 14:29:01 180

原创 2017002-分治算法

分治法的设计思想是：将一个难以直接解决的大问题，分割成一些规模较小的相同问题，以便各个击破，分而治之。分治策略是：对于一个规模为n的问题，若该问题可以容易地解决（比如说规模n较小）则直接解决，否则将其分解为k个规模较小的子问题，这些子问题互相独立且与原问题形式相同，递归地解这些子问题，然后将各子问题的解合并得到原问题的解。这种算法设计策略叫做分治法。如果原问题可分割成k个子

2017-03-05 20:43:52 228

原创小白开博+每日一题.2017001

这是第一次因为学习而开博客,在这个程序员大牛汇聚的CSDN发博客倍感压力在这里的目的就是能够学习到更多东西,同时在博友的督促下能坚持打代码。希望读者们在阅读时能包容我这个小白犯得低级错误在这里我相信我的编程能力能得到很大的提升。

2017-02-25 15:57:12 212

weixin_36322484的博客