github flow
這個很重要，如果未來要當工程師你一輩子都會用到
開 branch
commit... commit... commit...
push
在 github 上發 PR
等待 CICD 過了之後再 merge 進 master
- # Algorithm Search --- - [Binary Search]() - [Substring Search]() <!-- KMP Z Algorithm --> Sorting --- - [Quick Sort](/@ZR6dH1aATduk_4RRTWnaIg/S1jSPLBsB) - [Merge Sort](/@ZR6dH1aATduk_4RRTWnaIg/H11BFBIor) - [Heap Sort]() Tree --- - [Traversal]() - [DFS]() - [BFS]() Graph --- - [Shortest Path]() <!-- Dijkstra Algorithm / Bellman-Ford Algorithm Floyd-Warshall Algorithm --> - [MST]() ###### tags: `algorithm`
Hong-Kuan Wu changed 6 years agoBook mode
- 回饋推薦課程 === **POST /students/recommend/setStar** ## 說明 此推薦是否對你有幫助(1~5顆星) ## request param ```jsonid= { "star_level": "5", "student_id": "0516013", "unique_id": "108-1-1775" # 推薦課的 unique_id } ``` ## response example ```jsonid= { "info":{ "numRows":"0", "affectedRows":"1", "insertId":"0" } } ``` ###### tags: `CSCA`
- 取得推薦課程 === **GET /students/recommend/current** ## 說明 回傳推薦課程 ## request param none ## response example ```jsonid= [ { "unique_id":"108-1-1775", "cos_cname":"微分方程(英文班)", "cos_time":"1CD3B", "cos_code":"DCP2203", "teacher":"蔡淳仁" }, { "unique_id":"108-1-1237", "cos_cname":"多媒體資訊系統概論", "cos_time":"1B4EF", "cos_code":"DCP1138", "teacher":"蕭旭峰" } { ... } ] ``` ###### tags: `CSCA`
- 取得發燒選課 === **GET /students/recommend/courseList** ## 說明 回傳推薦課程 ## request param none ## response example ```jsonid= [ { "unique_id":"106-2-5244", "url":"https://timetable.nctu.edu.tw/?r=main/crsoutline&Acy=107&Sem=2&CrsNo=5234&lang=zh-tw", "cos_credit":"3", "cos_time":"1G4CD-EC330", "depType":"G", "tname":"詹力韋", "cos_cname":"設計未來互動技術(英文授課)" }, { "unique_id":"106-2-5242", "url":"https://timetable.nctu.edu.tw/?r=main/crsoutline&
- # Compiler : Front End > https://people.cs.nctu.edu.tw/~ypyou/courses/Compiler-f18/ > [color=pink] ## Lexical Analyzer > scanner * enter symbol table * token? lexeme? * token ex. KW * lexeme ex. int ### What is the difference between keyword and reserved word? https://stackoverflow.com/questions/1078908/what-is-the-difference-between-keyword-and-reserved-word ### lex > RE -> NFA -> DFA -> Optimize DFA -> C program > the longest-earliest match > 先判斷長ㄉ 一樣的話看前面ㄉ ```shell lex template.l
