626 1 分鐘

# 安裝 anaconda 前往 anaconda 網站進行下載 下載後會得到一個 `` 利用 bash [下載檔案名稱.sh] 開始安裝,接著按下 Enter 會有一段授權條款,可以用上下鍵看內容 接著會問你是否同意,輸入 yes 接著確認安裝位置,按下 Enter 接著安裝好後,記得重新開機 電腦重開後,終端機提示命令符會看到 (base) 在前面 可以利用 conda deactivate 退出 conda 環境 可以輸入以下指令,停用自動進入 conda 環境 conda config --set auto_activate_base false # 查看 conda...
818 1 分鐘

🌕🌗🌑🌑🌑 # 題目連結 題目連結 Online Judge uDebug # 題目說明 Time limit: 3.000 seconds # 題目 Given a line of text you will have to find out the frequencies of the ASCII characters present in it. The given lines will contain none of the first 32 or last 128 ASCII characters. Of course lines may end with \n and...
2.2k 2 分鐘

🌕🌗🌑🌑🌑 # 題目連結 題目連結 Online Judge uDebug # 題目說明 Time limit: 3.000 seconds # 題目 This is year 2200AD. Science has progressed a lot in two hundred years. Two hundred years is mentioned here because this problem is being sent back to 2000AD with the help of time machine. Now it is possible to...
694 1 分鐘

# Differen virtual environment venv peotry anaconda (minconda) Following this post we will show the difference virtual environment how to install and use. # Poetry # Install we have two methods for installing poetry use pipx If pipx is not already installed, you can follow any of the options in...
1.1k 1 分鐘

⭐️ # 題目敘述 The XOR total of an array is defined as the bitwise XOR of all its elements, or 0 if the array is empty. For example, the XOR total of the array [2,5,6] is 2 XOR 5 XOR 6 = 1 . Given an array nums , return the sum of all XOR totals for every subset of nums . Note: Subsets with the same...
2.6k 2 分鐘

# GPU 環境安裝 (在虛擬環境上的做法) RTX 3090 on Ubuntu 22.04.4 LTS + anaconda # 安裝 nvidia driver (驅動) sudo apt-get install nvidia-common# add nvidia ppasudo add-apt-respository ppa:graphics-drivers/ppasudo apt updateubuntu-drivers devices# install nvidia driversudo apt install nvidia-driver-535# 重新開機 reboot#...
1.2k 1 分鐘

⭐️⭐️⭐️ # 題目敘述 You are given the root of a binary tree with n nodes where each node in the tree has node.val coins. There are n coins in total throughout the whole tree. In one move, we may choose two adjacent nodes and move one coin from one node to another. A move may be from parent to child, or...
1.5k 1 分鐘

⭐️ # 題目敘述 You are given the root of a full binary tree with the following properties: Leaf nodes have either the value 0 or 1 , where 0 represents False and 1 represents True . Non-leaf nodes have either the value 2 or 3 , where 2 represents the boolean OR and 3 represents the boolean AND . The...
1.2k 1 分鐘

# 製作開機機碟 可以看官方提供的文件 Create a bootable USB stick with Rufus on Windows # 需要的東西 一個 4GB 以上的隨身碟 (空的或格式化過的) Windows 作業系統 Rufus 軟體,a free and open source USB stick writing tool Ubuntu ISO file 到 ubuntu 的官網下載 ISO 檔 Ubuntu 22.04.4 LTS 安裝 Rufus 插入 USB 隨身碟 Rufus 將更新,在設備欄位中設定設備 # 安裝單一系統 製作開機碟 /...
1.1k 1 分鐘

⭐️⭐️⭐️ # 題目敘述 You are given an m x n binary matrix grid . A move consists of choosing any row or column and toggling each value in that row or column (i.e., changing all 0 's to 1 's, and all 1 's to 0 's). Every row of the matrix is interpreted as a binary number, and the score of...