摘要：
目标是把这里的ppt什么的给下下来：https://web.stanford.edu/~jurafsky/slp3/ 阅读全文
posted @ 2018-12-01 22:06
bernieloveslife
阅读(114)
评论(0)
推荐(0)
摘要：
目标是把这里的所有东西下载下来： http://ftp.sjtu.edu.cn/archlinux/core/os/x86_64/ 直接看代码吧，也没啥好说的。 阅读全文
posted @ 2018-12-01 22:03
bernieloveslife
阅读(118)
评论(0)
推荐(0)
摘要：
Problem To celebrate the anniversary of Googleland, N couples are going to go for a boat ride in a rowboat. The rowboat is very long, but it is only o 阅读全文
posted @ 2018-12-01 22:00
bernieloveslife
阅读(443)
评论(0)
推荐(0)
摘要：
Problem Thanh wants to paint a wonderful mural on a wall that is N sections long. Each section of the wall has a beauty score, which indicates how bea 阅读全文
posted @ 2018-12-01 21:51
bernieloveslife
阅读(551)
评论(0)
推荐(0)
摘要：
Problem You are a contestant on a popular new game show and are playing for the grand prize! There are two big buttons, a red one and a black one. You 阅读全文
posted @ 2018-12-01 21:35
bernieloveslife
阅读(453)
评论(0)
推荐(0)
摘要：
Design a data structure that supports the following two operations: search(word) can search a literal word or a regular expression string containing o 阅读全文
posted @ 2018-12-01 21:18
bernieloveslife
阅读(116)
评论(0)
推荐(0)
摘要：
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. The update(i, val) function modifies nums by upd 阅读全文
posted @ 2018-12-01 20:55
bernieloveslife
阅读(196)
评论(0)
推荐(0)
摘要：
Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1. Example 1: Input: 阅读全文
posted @ 2018-12-01 19:10
bernieloveslife
阅读(346)
评论(0)
推荐(0)
摘要：
Given a square array of integers A, we want the minimum sum of a falling path through A. A falling path starts at any element in the first row, and ch 阅读全文
posted @ 2018-12-01 15:56
bernieloveslife
阅读(152)
评论(0)
推荐(0)
摘要：
In a string S of lowercase letters, these letters form consecutive groups of the same character. For example, a string like S = "abbxxxxzyy" has the g 阅读全文
posted @ 2018-12-01 14:55
bernieloveslife
阅读(158)
评论(0)
推荐(0)
浙公网安备 33010602011771号