Clay

LeetCode: 1561-Maximum Number of Coins You Can Get 解題紀錄

Clay
2023-11-242023-11-24
C++, LeetCode, Python

題目

There are 3n piles of coins of varying size, you and your friends will take piles of coins as follows:

[論文閱讀] Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection

Clay
2023-11-22
Papers

前言

RAG-based LLM 是當前使用大型語言模型（Large Language Model, LLM）的一種知名架構，也就是通過『檢索』，來給模型提供訓練時所沒有的先驗知識，讓模型能夠在得知特定資訊的情況下進行問題的回答。

[Linux] 開源防毒軟體 ClamAV 的安裝與使用

Clay
2023-11-202023-11-20
Linux

介紹

雖然 Linux 號稱鮮少有駭客散佈病毒，但實際上，Linux 做為穩定的伺服器或開發環境依然是非常有價值、非常具有經濟效益的作業系統 —— 所以雖然相比 Windows 數量較少，但 Linux 還是存在許多惡意軟體或駭客攻擊的。

LeetCode: 2391-Minimum Amount of Time to Collect Garbage 解題紀錄

Clay
2023-11-202023-11-20
C++, LeetCode, Python

題目

You are given a 0-indexed array of strings garbage where garbage[i] represents the assortment of garbage at the i^th house. garbage[i] consists only of the characters 'M', 'P' and 'G' representing one unit of metal, paper and glass garbage respectively. Picking up one unit of any type of garbage takes 1 minute.

[Linux] 使用指令增加 Swap 空間來避免記憶體耗盡

Clay
2023-11-162023-12-10
Linux

什麼是 Swap？

Swap 空間在 Linux 作業系體中扮演著重要角色。它可以被理解為是虛擬記憶體空間，名稱就是交換（swap）的意思，能夠在系統實體記憶體（RAM）不夠用的時候，把記憶體比較少用到的資料暫時寫到一個固定的硬碟空間來保證系統穩定運行 —— 這個空間就是 Swap。

LeetCode: 2849-Determine if a Cell Is Reachable at a Given Time 解題紀錄

Clay
2023-11-082023-11-08
C++, LeetCode, Python

題目

You are given four integers sx, sy, fx, fy, and a non-negative integer t.

In an infinite 2D grid, you start at the cell (sx, sy). Each second, you must move to any of its adjacent cells.

LeetCode: 1921-Eliminate Maximum Number of Monsters 解題紀錄

Clay
2023-11-072023-11-07
C++, LeetCode, Python

題目

You are playing a video game where you are defending your city from a group of n monsters. You are given a 0-indexed integer array dist of size n, where dist[i] is the initial distance in kilometers of the ith monster from the city.