contributed by < Jackiempty >
第一週測驗題
題目
測驗一
測驗一在於參考 Optimized QuickSort — C Implementation (Non-Recursive) 去實作連結佇列的 Quick sort,裡面用了begin[]和end[]去取代原本使用遞迴的方式,具體實作方式如下:
實作方式每一輪排序是利用 L 及 R 分別指向被排序之鍵結串列的第一個節點與最後一個節點,每次挑選最左邊之節點為 pivot ,利用節點 p, n 走訪整個串列。
p 會存取下一個要走訪的節點,避免因為 n 的移除而無法完成串列的走訪。
Jackiempty changed 3 months agoView mode Like Bookmark
There are couple of ways to implement route capturing, and the way I chose to try is is to implement it with color selection.
For you to know, the color composition of an image is both the color and the brightness. Take a JPEG image as an instance, it is composed of three layers of color which is Red, Green, and Blue respectively. For each color has its own transparency, and an image is the combination of all three color with it transparency in each pixel, which build up the whole picture with lots of pixels.
image
source: https://en.wikipedia.org/wiki/Pixel_art
So how exactly to recognize the lane shape just by detecting color?
Jackiempty changed a year agoView mode Like Bookmark