鐵人檔案
此主題將有三位參賽者共同參與，我們將合力完成三方共 90篇的鐵人文章（Java刷題A/B和C++刷題）。根據LeetCode Top 100 Liked題目集的脈絡，我們將介紹共十四種演算法，並透過Java和C++實作LeetCode上的題目。
Problem :Given an encoded string, return its decoded string.The encoding rule is...
Problem : Given an array of integers temperatures represents the daily temperatu...
回溯法(Backtracking)，為經過優化的暴力法，透過制定上下界找到答案，採用試錯的方式將所有可能性列出，只要無法得到有效的結果就不再循著該路徑往下運算，...
Problem : Given n pairs of parentheses, write a function to generate all combina...
Problem : Given an array of distinct integers candidates and a target integer ta...
Problem : Given an m x n grid of characters board and a string word, return true...
動態規劃(Dynamic programming)，將複雜的問題分解成較為簡單的子問題來處理，在處理子問題的過程中可以尋找其中的規律，並將每一次的結果都進行計算...
Problem : You are climbing a staircase. It takes n steps to reach the top. Each...
Problem : Given a m x n grid filled with non-negative numbers, find a path from...
Problem : You are a professional robber planning to rob houses along a street. E...
