About Yu-Yan Tsai (Yuyan) - CV
Yu-Yan Tsai(Ezio)Email: st3265987410@gmail.com Phone: +886-923-XXX-XXX
閱讀更多
Ubuntu uploading debian package to PPA
前言
本篇假設已經擁有Ubuntu社群帳號。
用ubuntu帳號 登入 ppa (https://launchpad.net/)
openg
2023-09-12
Openssl - 快速產生重要檔案
紀錄產生CA的腳本範例， 20240912 新增SAN用法，SAN用法就是讓COMMON NAME 可以綁多重IP。
2023-05-30
Ubuntu 試用 gptcommit 懶人工具
請先申請 openAI key, 透過 chatgpt 網站申請
Reference and Source site
cargo ins
2023-02-17
Ubuntu 使用 docker 快速架 mosquitto
Tree$ tree mosquitto/
mosquitto/
├── config
│ ├── certs
│ │ ├──
2022-12-27
Ubuntu 應用 net-snmp v3 snmptrap snmptrapd 範例筆記
snmptrap snmptrapd snmpv3 簡易測試範例
2022-11-16
Ubuntu 使用 docker 快速架 NTP Server
因為專案有用到 ntp server 為避免一堆不必要的麻煩用docker image 直接架一個測試用的 ntp serverudp p
2022-09-12
Git Github 筆記
git commits 大合併# Reset the current branch to the commit just before th
2021-12-17
Ubuntu 工具 socat
Socat is a network swiss army knife utility and it is very similar to Netcat.
2021-10-19
Ubuntu 工具 graph-easy
提升程式碼逼格
2021-10-19
Hexo - gitalk 403 issue
issueblog 文章底下 gitalk 插件，再登入 github 帳號後 一直轉圈，並得到 error code 403
solver
2021-10-18
Ubuntu 手動新增 swap
常用於實體記憶體不足之OS。
2021-08-10
Ubuntu OpenLDAP 移植 mips64-octeon-linux(mips64-octeon-linux-gnu)
OpenLDAP移植mips64-octeon-linux的相關筆記
2021-04-12
Ubuntu OpenLDAP 移植 arm-linux(arm-linux-gnueabihf)
OpenLDAP移植arm-linux的相關筆記
2021-04-12
1038. Binary Search Tree to Greater Sum Tree
Link: https://leetcode.com/problems/binary-search-tree-to-greater-sum-
2020-10-30
538. Convert BST to Greater Tree
Link: https://leetcode.com/problems/convert-bst-to-greater-tree/
Given
2020-10-30
Ubuntu 啟用 google bbr
reference:
quic: [https://en.wikipedia.org/wiki/QUIC]
eanble bbr: [ht
2020-10-27
1081. Smallest Subsequence of Distinct Characters
Link: [https://leetcode.com/problems/smallest-subsequence-of-distinct-
2020-10-14
1399_Count Largest Group
Link: https://leetcode.com/problems/count-largest-group/
Given an inte
2020-10-05
1446. Consecutive Characters
Link: https://leetcode.com/problems/consecutive-characters/
Given a st
2020-09-30
LeetCode Note.
Common Container1. string
substr(i,str.length()-i)
find
rfind
c_str()
2020-09-30
1413. Minimum Value to Get Positive Step by Step Sum
Link: https://leetcode.com/problems/minimum-value-to-get-positive-step
2020-09-29
1403. Minimum Subsequence in Non-Increasing Order
Link: https://leetcode.com/problems/minimum-subsequence-in-non-increas
2020-09-29
algorithm - test2
Question輸入一個金額 dst，列出最佳找法。
Anwser程式思路:
用 BFS 直接展開解
#include <iostre
2020-09-28
algorithm - test1
QuestionGiven a string with “a~z” and “<” that represent you type t
2020-09-27