back in time

Daily English Dictation Number Two

笑着哭i 提交于 2020-08-17 03:46:01
以下内容同时会在微信公众号同步更新: 电子小彭友 (便于手机随时随地翻阅) 抖音/b站:Darren_pty Coach Shane 是美国的一位帮助热爱英语的人更好地掌握英语的老师,他的微博口号是:“Helping students master english !”。 据我所知,老师已经推出四个作品,按照难度级别分别是:E-cubed(Daily Easy English Expression日常英语轻松表达),Daily English Dictation(DD每日听写),DDM(Daily Dictation Members会员每日听写),PIRF(Pronunciation, Intonation, Rhythm and Flow发音、语调、节奏和流畅);其中DDM和PIRF是收费的,有志提高自己相应能力的朋友可以去听老师的课程,在老师的微博就可以找到报名链接(老师人挺不错,算是帮老师宣传一下吧)。在学习他的DD时,发现视频下面字幕不完整且有部分错误,我就尝试在网上找了一下资源,发现只有一个叫“译学馆”的网站上有DD的字幕(只做了五个视频且大量错误,有时间的同学可以去看一看我说的是这样的情况不)。于是我决定做把自己的分享出来,帮助大家在看Coach Shane老师的DD作品时有不懂的,可以来参照,哈哈。 听写原文: Jerry, What time do you have

每个程序员应阅读的最具影响力的单一书籍是什么? [关闭]

梦想与她 提交于 2020-08-09 04:46:48
问题: If you could go back in time and tell yourself to read a specific book at the beginning of your career as a developer, which book would it be? 如果你可以回到过去并告诉自己在开始时作为开发人员阅读一本特定的书,那本书会是哪本书? I expect this list to be varied and to cover a wide range of things. 我希望这个列表可以变化,涵盖范围广泛。 To search: Use the search box in the upper-right corner. 要搜索: 使用右上角的搜索框。 To search the answers of the current question, use inquestion:this . 要搜索当前问题的答案,请使用 inquestion:this 。 For example: 例如: inquestion:this "Code Complete" 解决方案: 参考一: https://stackoom.com/question/Rb/每个程序员应阅读的最具影响力的单一书籍是什么-关闭 参考二: https://oldbug.net/q

每个程序员应阅读的最具影响力的单一书籍是什么? [关闭]

爷,独闯天下 提交于 2020-08-04 14:25:10
问题: If you could go back in time and tell yourself to read a specific book at the beginning of your career as a developer, which book would it be? 如果你可以回到过去并告诉自己在开始时作为开发人员阅读一本特定的书,那本书会是哪本书? I expect this list to be varied and to cover a wide range of things. 我希望这个列表可以变化,涵盖范围广泛。 To search: Use the search box in the upper-right corner. 要搜索: 使用右上角的搜索框。 To search the answers of the current question, use inquestion:this . 要搜索当前问题的答案,请使用 inquestion:this 。 For example: 例如: inquestion:this "Code Complete" 解决方案: 参考一: https://stackoom.com/question/Rb/每个程序员应阅读的最具影响力的单一书籍是什么-关闭 参考二: https://oldbug.net/q

最短路问题

二次信任 提交于 2020-07-28 10:05:23
* 加载本页面时,公式可能未渲染(显示乱码)请刷新该页面重试 单源最短路 Dijkstra算法(不带负权,单源最短路) (这里干讲不好说,所以直接上模板题来分析一下) 时间复杂度 \(O(N^2)\) (朴素) \(O((M+N)logN)\) (优化后) 空间复杂度 \(O(M)\) 模板题 [1] POJ-2387 Til the Cows Come Home Description Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible. Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N.