Ownership & Permissions 參考 查看權限 Ownership User (Owner) Group Others Permissions Read Write Execute Commands 群組與使用者相關操作 查看使用者所屬群組 cat /etc/group | grep {username} 新建群組 sudo addgroup {group_name} 刪除 ...
~/.ssh/config Host ... HostName ... User ... IdentityFile .../....pem Username in EC2 Instance Amazon EC2: Manage users on your Linux instance – Default user names
lib/main.dart This file contains the main entry point and the application widgets. lib/config.dart This file contains the environment settings. pubspec.yaml This file contains the package configurati ...
受密碼保護的文章不會產生內容摘要。
https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule Solution: Top-Down DP n := len(jobDifficulty) Time Complexity: O((d * n) * n) = O(d * (n ** 2)) recursion call stack: O(d * n) for i ...
Format 件名 (Title)：【{自分の所属する組織名}】{用件}について 本文 (Body)： {宛名：[{組織名}][{部署名}][{役職}]{名前}様} お世話になっております (冒頭の挨拶)。[{組織名}の]{名前}です。 {本メールの結論} {詳細内容} よろしくお願いいたします (結びの挨拶)。 {署名 (簽名檔；Signature Line/Block)} 冒頭の挨拶の例 お世 ...
https://leetcode.com/problems/maximal-network-rank Solution E := number of edges = len(cities) V := number of vertexes/nodes = len(roads) Time Complexity: O(E + V ** 2) Space Complexity: O(E) (The inp ...
https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing Solution n := len(nums) Ni := nums[i] i := [1, n – 1] 「如果我們從 nums 刪除一個節點後，nums 為嚴格遞增」 如果 nums 原本不是嚴格遞增 但符合題 ...
https://leetcode.com/problems/sliding-window-maximum First Solution Time Complexity: O((n – k) * log(k)) Space Complexity: O(k) (The input and output generally do not count towards the space com ...
timeit timeit timeit.timeit( stmt='pass', setup='pass', timer=<default timer>, number=1000000, globals=None ) repeat timeit.repeat( stmt='pass', setup='pass', timer=<default t ...
