刘慈欣作品摘录
- 《三体》
维德抬头看着程心，目光中又露出了那种罕见的无助和乞求，他一字一顿地说：「失去人性，失去很多；失去兽性，失去一切。」
「我选择人性。」程心说，环视所有人，「我想你们也是。」
Running solution
Refs
US Solution
Programs
| University | Program | Span | Application time | Requirements | Tuition | Features |
|---|---|---|---|---|---|---|
| UCI | MCS | 15 months | 2022.10.3~2023.3.1 | TOEFL 80, IELTS 7(each >= 6), 3 rec letters | around 50k | |
| SJSU | Bay area | |||||
| USC | Los Angelos | |||||
| Santa Clara | Bay area | |||||
| USF | San Francisco, Close to F, G | |||||
| SFSU | San Francisco, Close to F, G | |||||
| UW-Tacoma | Seattle | |||||
| Northeastern University Seattle | Seattle | |||||
| NYU Tandon | NY |
US Visa
Canada Solution
Programs(Mostly in vancouver)
NEU Vancouver:
FDU Vancouver:
NYIT
- Only cybersecurity program provided
- Intro
SFU
- Intro
- 3.0/4.33, 3/4(china), TOEFL 93(20 each), IELTS 7(6.5 each)
TRU
- Intro, Only provides MS in Data Science
- IELTS 6.5(6.0 each), TOEFL 570(?) TWE 4.5, two rec, 3.0/4.33
Lethbridge
UBC
Waterloo
- Not in Vancouver and hard to apply
Visa
- 1 year program gives 1 year work permit, 2 year program gives 3 year work permit
Others
Glossary
coop
Align: The Northeastern University Align program provides a direct path to a Master of Science in Computer Science (MSCS) for non-computer science majors without programming experience.
Leetcode
Title
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // 804. Unique Morse Code Words (Easy) | |
| // https://leetcode.com/problems/unique-morse-code-words/ | |
| // 1. Naive answer: | |
| const alphabetTable: {[prop:string]: string} = { | |
| 'a': ".-", | |
| 'b': "-...", | |
| 'c': "-.-.", | |
| 'd': "-..", | |
| 'e': ".", | |
| 'f': "..-.", | |
| 'g': "--.", | |
| 'h': "....", | |
| 'i': "..", | |
| 'j': ".---", | |
| 'k': "-.-", | |
| 'l': ".-..", | |
| 'm': "--", | |
| 'n': "-.", | |
| 'o': "---", | |
| 'p': ".--.", | |
| 'q': "--.-", | |
| 'r': ".-.", | |
| 's': "...", | |
| 't': "-", | |
| 'u': "..-", | |
| 'v': "...-", | |
| 'w': ".--", | |
| 'x': "-..-", | |
| 'y': "-.--", | |
| 'z': "--.." | |
| } | |
| function uniqueMorseRepresentations(words: string[]): number { | |
| let uniqueTransformations = new Set<string>() | |
| words.forEach(word => { | |
| let transformation: string = '' | |
| for(let i = 0; i < word.length; i++) { | |
| transformation += alphabetTable[word[i]] | |
| } | |
| console.log(transformation) | |
| uniqueTransformations.add(transformation) | |
| }) | |
| return uniqueTransformations.size | |
| }; | |
| // 2. Refined Answer: | |
| function uniqueMorseRepresentations_refined(words: string[]): number { | |
| const morseCodes: string[] = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."] | |
| const transformationSet = new Set<string>() | |
| words.forEach(word => { | |
| let wordInMorse = '' | |
| for (let i = 0; i < word.length; i++) { | |
| wordInMorse += morseCodes[word[i].charCodeAt(0) - 'a'.charCodeAt(0)] | |
| } | |
| transformationSet.add(wordInMorse) | |
| }) | |
| return transformationSet.size | |
| } | |
| console.log(uniqueMorseRepresentations_refined(["gin","zen","gig","msg"])) |
test1
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // 804. Unique Morse Code Words (Easy) | |
| // https://leetcode.com/problems/unique-morse-code-words/ | |
| // 1. Naive answer: | |
| const alphabetTable: {[prop:string]: string} = { | |
| 'a': ".-", | |
| 'b': "-...", | |
| 'c': "-.-.", | |
| 'd': "-..", | |
| 'e': ".", | |
| 'f': "..-.", | |
| 'g': "--.", | |
| 'h': "....", | |
| 'i': "..", | |
| 'j': ".---", | |
| 'k': "-.-", | |
| 'l': ".-..", | |
| 'm': "--", | |
| 'n': "-.", | |
| 'o': "---", | |
| 'p': ".--.", | |
| 'q': "--.-", | |
| 'r': ".-.", | |
| 's': "...", | |
| 't': "-", | |
| 'u': "..-", | |
| 'v': "...-", | |
| 'w': ".--", | |
| 'x': "-..-", | |
| 'y': "-.--", | |
| 'z': "--.." | |
| } | |
| function uniqueMorseRepresentations(words: string[]): number { | |
| let uniqueTransformations = new Set<string>() | |
| words.forEach(word => { | |
| let transformation: string = '' | |
| for(let i = 0; i < word.length; i++) { | |
| transformation += alphabetTable[word[i]] | |
| } | |
| console.log(transformation) | |
| uniqueTransformations.add(transformation) | |
| }) | |
| return uniqueTransformations.size | |
| }; | |
| // 2. Refined Answer: | |
| function uniqueMorseRepresentations_refined(words: string[]): number { | |
| const morseCodes: string[] = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."] | |
| const transformationSet = new Set<string>() | |
| words.forEach(word => { | |
| let wordInMorse = '' | |
| for (let i = 0; i < word.length; i++) { | |
| wordInMorse += morseCodes[word[i].charCodeAt(0) - 'a'.charCodeAt(0)] | |
| } | |
| transformationSet.add(wordInMorse) | |
| }) | |
| return transformationSet.size | |
| } | |
| console.log(uniqueMorseRepresentations_refined(["gin","zen","gig","msg"])) |
test2
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // 804. Unique Morse Code Words (Easy) | |
| // https://leetcode.com/problems/unique-morse-code-words/ | |
| // 1. Naive answer: | |
| const alphabetTable: {[prop:string]: string} = { | |
| 'a': ".-", | |
| 'b': "-...", | |
| 'c': "-.-.", | |
| 'd': "-..", | |
| 'e': ".", | |
| 'f': "..-.", | |
| 'g': "--.", | |
| 'h': "....", | |
| 'i': "..", | |
| 'j': ".---", | |
| 'k': "-.-", | |
| 'l': ".-..", | |
| 'm': "--", | |
| 'n': "-.", | |
| 'o': "---", | |
| 'p': ".--.", | |
| 'q': "--.-", | |
| 'r': ".-.", | |
| 's': "...", | |
| 't': "-", | |
| 'u': "..-", | |
| 'v': "...-", | |
| 'w': ".--", | |
| 'x': "-..-", | |
| 'y': "-.--", | |
| 'z': "--.." | |
| } | |
| function uniqueMorseRepresentations(words: string[]): number { | |
| let uniqueTransformations = new Set<string>() | |
| words.forEach(word => { | |
| let transformation: string = '' | |
| for(let i = 0; i < word.length; i++) { | |
| transformation += alphabetTable[word[i]] | |
| } | |
| console.log(transformation) | |
| uniqueTransformations.add(transformation) | |
| }) | |
| return uniqueTransformations.size | |
| }; | |
| // 2. Refined Answer: | |
| function uniqueMorseRepresentations_refined(words: string[]): number { | |
| const morseCodes: string[] = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."] | |
| const transformationSet = new Set<string>() | |
| words.forEach(word => { | |
| let wordInMorse = '' | |
| for (let i = 0; i < word.length; i++) { | |
| wordInMorse += morseCodes[word[i].charCodeAt(0) - 'a'.charCodeAt(0)] | |
| } | |
| transformationSet.add(wordInMorse) | |
| }) | |
| return transformationSet.size | |
| } | |
| console.log(uniqueMorseRepresentations_refined(["gin","zen","gig","msg"])) |
语录
人人都歌颂二舅，但是没人想成为二舅；
人人都唾骂周公子，但是人人都想做周公子。
——互联网
谎言不会伤人，真相才是快刀。
——青钢影
