LeetCode: 985-Sum of Even Numbers After Queries 解題紀錄
題目
You are given an integer array nums
and an array queries
where queries[i] = [vali, indexi]
.
You are given an integer array nums
and an array queries
where queries[i] = [vali, indexi]
.
Given a list paths
of directory info, including the directory path, and all the files with contents in this directory, return all the duplicate files in the file system in terms of their paths. You may return the answer in any order.
An integer array original
is transformed into a doubled array changed
by appending twice the value of every element in original
, and then randomly shuffling the resulting array.
Given a binary tree where node values are digits from 1 to 9. A path in the binary tree is said to be pseudo-palindromic if at least one permutation of the node values in the path is a palindrome.
Read More »LeetCode: 1457-Pseudo-Palindromic Paths in a Binary Tree 解題紀錄Given an integer array data
representing the data, return whether it is a valid UTF-8 encoding (i.e. it translates to a sequence of valid UTF-8 encoded characters).
You have an initial power of power
, an initial score of 0
, and a bag of tokens
where tokens[i]
is the value of the ith
token (0-indexed).
ngrok 是一個全球都可以使用的『反向代理』(reverse proxy)工具,它可以把你在任何裝置中運行的網頁服務轉發到一組公開的網址。
Read More »[Linux] 使用 ngrok 搭建臨時的伺服器、並轉發端口最近我在 PS5 上把新發售的《仙劍奇俠傳七》給通關並白金(全成就達成)了。趁著記憶猶新,就來記錄一下我的遊玩體驗。
(註:有劇情雷)
Read More »《仙劍奇俠傳七》玩後心得:少見的國產遊戲(?)畫面精緻之作、然劇情較系列作略顯平淡如果在用 Python 處理字串時,我們需要匹配一個特殊的關鍵字,然後在左右側添加 HTML 的標籤,我們應該怎麼做呢?
Read More »[Python] 正規表示法(Regular Expression)取代字串時保留關鍵字遲了好幾天了,本來我的這個部落格應該是在 2019-07-28 這天建立的,但是我一直拖到了今天 2022-08-06 才寫。只能說,最近真的發生了太多、太多事了。
Read More »建立部落格第三年紀念