2017年10月_stary_yan

12月 11月 10月 09月 08月 07月 06月 01月

原创 [Leetcode] Greedy

[Leetcode] Greedy502 IPODescriptionAnalysisThis problem can be easily described as we need to find the most profitable projects with the ability to afford the necessary capital. The problem can be solv

2017-10-26 15:15:40 264

原创安装 cobra

安装 cobra首先确定环境变量中已经设置了GOPATHecho $GOPATH使用命令 go get -v github.com/spf13/cobra/cobra 下载过程中，会出提示如下错误Fetching https://golang.org/x/sys/unix?go-get=1 https fetch failed: Get https://golang.org/x/sys/unix?g

2017-10-22 11:26:03 1476 1

原创 [Leetcode]Course Schedule

Course Schedule1Course ScheduleAccording to the problem description, it is easily to find that we need to use Topological Sort to solve with the problem. Topological Sort is an easy algorithm. If a nod

2017-10-18 19:03:37 250

原创 [Leetcode] 211 & 208 Trie Tree

[Leetcode] 211 & 208 Trie TreeTrieIn computer science, a trie, also called digital tree and sometimes radix tree or prefix tree (on the ground that they can be searched by prefixes), is a kind of searc

2017-10-12 11:08:01 389

原创 [Leetcode] 321.Create Maximum Number

[Leetcode] 321.Create Maximum Number[Description]321. Create Maximum Number[Analysis]To create max number of length k from two arrays, you need to create max number of length i from array one and max n

2017-10-08 22:44:09 260

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

原创 [Leetcode] Greedy

原创 安装 cobra

原创 [Leetcode]Course Schedule

原创 [Leetcode] 211 & 208 Trie Tree

原创 [Leetcode] 321.Create Maximum Number

空空如也

空空如也

原创安装 cobra