[LeetCode] Find Median from Data Stream
Median is the middle value in an ordered integer list. If the size of the list i
[LeetCode從零單刷]Longest Increasing Subsequence
題目： Given an unsorted array of integers, find the length of longest increas
[並發並行]_[C/C++]_[使用線程本地存儲Thread Local Storage(TLS)調用復制文件接口的案例]
使用場景:1. 在復制文件時,一般都是一個線程調用一個接口復制文件,這時候需要緩存數據,如果每個文件都需要創建獨立的緩存,那麼內存碎片是很大的.如果
[LeetCode] Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find th
HDU 2128Tempter of the Bone II
Tempter of the Bone IITime Limit : 10000/5000ms (Java/Other) Memory Limit
[LeetCode] Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result
C++11新特性之 rvalue Reference(右值引用)
右值引用可以使我們區分表達式的左值和右值。 C++11引入了右值引用的概念，使得我們把引用與右值進行綁定。使用兩個“取地址符號”： i
[LeetCode] Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s
(React: Up and Running)閱讀筆記 — JSX
Transpiling JSX transpilation是獲取source code， 然後使用老版本浏覽器可以理解的JavaScript來重寫的過程，這兩
(React: Up and Running)閱讀筆記 — The life of a component & Excel: a fancy table component
Properties 要把Component的this.props屬性認為是可讀的，properties用來從parent component傳遞configu
HDU 2918 Tobo or not Tobo
Tobo or not ToboTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768
