Sep 3『Effective debugging』 軟體與系統除錯的66個具體作法 — 筆記 (1)週末閒暇之餘，有空提前預約了在桃園圖書館提供的工具書，也就是 『Effective debugging』 軟體與系統除錯的66個具體作法 在近期工作 & 開發過程裡，有時感覺到開發直覺漸漸鈍化，缺少了一些思想上的刺激 & 不同的解決思路，反而會漸漸地陷入只有過去成功Debug經驗才是正確無誤的思想盲區. 因此, 在避免這種情況持續惡化的情況下， …Effective5 min readEffective5 min read
Jun 1Docker 簡介 & 學習筆記— 1對於許多已經有過開發經驗 or 運維經驗的工程師來說, Docker是一個極不陌生的名詞，也是軟體開發裡加速開發週期跟降低部署成本的重要工具之一。 它是屬於開源容器引擎，主要負責自動化部署、應用程序相依性套件(Dependency package)的打包和運行。 其最著名的特性就是虛擬容器化。顧名思義，可以讓應用程序和其相關的依賴項能夠在隔離環境中運行 …Docker3 min readDocker3 min read
Jan 11LeetCode — Set Matrix ZeroesGiven an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. You must do it in place. Example 1: Input: matrix = [[1,1,1],[1,0,1],[1,1,1]] Output: [[1,0,1],[0,0,0],[1,0,1]] Example 2:Leetcode1 min readLeetcode1 min read
Jan 9LeetCode — Reorder List (Blind Curated 45)You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln Reorder the list to be on the following form: L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2…Leetcode1 min readLeetcode1 min read
Jan 7LeetCode — Remove Nth Node From End of ListGiven the head of a linked list, remove the nth node from the end of the list and return its head. Example 1: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Example 2: Input: head = [1], n = 1 Output: [] Example 3: Input: head = [1,2], n…Leetcode1 min readLeetcode1 min read
Dec 23, 2022LeetCode — Merge K sorted lists (Blind Curated 43)You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it. Example 1: Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2,3,4,4,5,6] Explanation: The linked-lists are: [ 1->4->5, 1->3->4, 2->6 ] merging them into one sorted list: 1->1->2->3->4->4->5->6…Leetcode Solution1 min readLeetcode Solution1 min read
Dec 19, 2022LeetCode — Non-overlapping intervals (Blind Curated 37)Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Example 1: Input: intervals = [[1,2],[2,3],[3,4],[1,3]] Output: 1 Explanation: [1,3] can be removed and the rest of the intervals are non-overlapping. …Leetcode Medium1 min readLeetcode Medium1 min read
Dec 11, 2022LeetCode — Insert Interval (Blind Curated 35)You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of…Leetcode Medium1 min readLeetcode Medium1 min read
Dec 10, 2022LeetCode — Longest consecutive sequence (Blind Curated 31)Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1: Input: nums = [100,4,200,1,3,2] Output: 4 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4. …Leetcode Medium1 min readLeetcode Medium1 min read
Dec 8, 2022LeetCode — Number of Islands (Blind Curated 30)Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are…Leetcode1 min readLeetcode1 min read
