puppeteer 螢幕截圖轉 base64 編碼問題puppeteer 提供了一組操控 chrome 的 API，藉由這些 API 我們可以模擬使用者進行頁面上的各種操作，很適合拿來當作爬蟲工具。最近正好專案有使用到這個 library，遇到了螢幕截圖的問題，進行各種搜尋都很少有直接的解答，只好自己摸了一番。Sep 11, 2019Sep 11, 2019
![[LeetCode 筆記] 19. Remove Nth Node From End of List](https://miro.medium.com/v2/resize:fill:160:106/0*iAckbsXrLGMe4Uxl.jpg)
![[LeetCode 筆記] 19. Remove Nth Node From End of List](https://miro.medium.com/v2/resize:fill:320:214/0*iAckbsXrLGMe4Uxl.jpg)
![[LeetCode 筆記] 5. Longest Palindromic Substring](https://miro.medium.com/v2/resize:fill:160:106/1*uvanMf7yr8bB-_PDFXiJvQ.png)
![[LeetCode 筆記] 5. Longest Palindromic Substring](https://miro.medium.com/v2/resize:fill:320:214/1*uvanMf7yr8bB-_PDFXiJvQ.png)
![[LeetCode 筆記] 3. Longest Substring Without Repeating Characters](https://miro.medium.com/v2/resize:fill:160:106/1*fvlNHY9JgcM0nsm03RFPvg.png)
![[LeetCode 筆記] 3. Longest Substring Without Repeating Characters](https://miro.medium.com/v2/resize:fill:320:214/1*fvlNHY9JgcM0nsm03RFPvg.png)
![[Leetcode 筆記] 1143. Longest Common Subsequence](https://miro.medium.com/v2/resize:fill:160:106/1*pJ-xqXleIaDLGvdy5zxfrg.png)
![[Leetcode 筆記] 1143. Longest Common Subsequence](https://miro.medium.com/v2/resize:fill:320:214/1*pJ-xqXleIaDLGvdy5zxfrg.png)
![[Leetcode 筆記] 322. Coin Change](https://miro.medium.com/v2/resize:fill:160:106/1*MP-uqqXOEMk6w4SBH_qtSg.png)
![[Leetcode 筆記] 322. Coin Change](https://miro.medium.com/v2/resize:fill:320:214/1*MP-uqqXOEMk6w4SBH_qtSg.png)
