Publish Date : 2024-04-02 09:25 在影像處理打滾的人 沒有人知道Lena的大名吧？ 以下這張圖片風行了五十多年 甚至還有維基頁面 現在，“她"即將退役

Publish Date : 2024-03-25 09:37 韌體的設定中，GPIO及DAC的module設定算是比較簡單的 這章會主要說明一些GPIO可能會常用到的設定 並一樣以TI F28004

Publish Date : 2024-02-15 09:29 當今韌體可被視為較為簡易的軟體 以軟體的角度可以這麼說不為過 但如果是越靠近硬體的韌體 這樣的說法可能要改變 我的背景為軟體 幾乎都沒有碰過

Publish Date : 2020-09-16 14:43 題目： Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13. For all leaves in the tree, consider the numbers represented by the path

Publish Date : 2020-09-11 10:14 題目： The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, F(0) = 0, F(1) = 1F(N) = F(N - 1) + F(N - 2), for N > 1. Given N, calculate F(N). Example：

Publish Date : 2020-09-11 10:11 題目： Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays. The distance value is defined as the number of elements arr1[i] such that there is not any element arr2[j] where |arr1[i]-arr2[j]| <= d. 範例： Input: arr1 = [4,5,8], arr2 = [10,9,1,8], d = 2Output: 2 Explanation: For arr1[0]=4 we have: |4-10|=6

Publish Date : 2020-09-11 10:10 題目： A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. Example： Input: [1,1,1,1,1,null,1] Output: true 解法： 這題只是要判斷二元樹中所有val是否相同 一

Publish Date : 2020-08-03 09:27 問題： Every email consists of a local name and a domain name, separated by the @ sign. For example, in alice@leetcode.com, alice is the local name, and leetcode.com is the domain name. Besides lowercase letters, these emails may contain '.'s or '+'s. If you add periods ('.') between some characters in the local name part of an email address, mail sent there will

Publish Date : 2020-07-30 14:56 題目： Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples). 範例： Input: root = [1,null,3,2,4,null,5,6] Output: 3 解

Publish Date : 2020-07-20 15:57 最近公司增加了新的需求 使用.net core開發WPF 所以就順便學了C# 還記得在大學的時候就學過C#開發視窗程式 對這個語言實在是喜歡