[LeetCode]Edit Distance 題目 Given two words word1 and word2, find the minimum

hdu 1372 Knight Moves BFS解法 Knight Moves Time Limit: 2000/1000 MS (Java/Othe

[Lua]Lua內存洩露檢測原理 lua內存洩露 首先第一點，lua中的內存洩露和我們所說的c/c++中的內存洩露本質上是不一樣的。 lua

[LeetCode]Maximum Depth of Binary Tree Given a binary tree, find its maximu

杭電ACM 二 N^N的個位數 Problem Description Given a positive integer N, you should out

HDU 4085 Peach Blossom Spring 記憶化搜索枚舉子集 斯坦納樹 題目鏈接：點擊打開鏈接 題意: 第一行輸入n個點 m條可修建的無向

[LeetCode]Binary Tree Inorder Traversal Given a binary tree, return the ino

UVA 572- Oil Deposits(簡單dfs) Oil Deposits Time Limit:3000MS Memory Limi

Geometry Made Simple Geometry Made Simple Description Mathematics can be so

hdu1024---Max Sum Plus Plus Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/

HDU 3616 Best Reward (Manacher算法 前綴回文＋後綴回文)   Best Reward Time Limit: 20

lua學習筆記---選擇，循環語句 選擇語句 形式： if 條件 then 分支 end 注：括號可以去掉 if 條件 t

C++ virtual table pointer - vptr To implement virtual functions, C++ u

poj 1655 樹形dp求取樹的重心 http://poj.org/problem?id=1655 Description Consider a tr

UVA 657-The die is cast(dfs*2) The die is cast Time Limit:3000MS Memory

LeetCode Single Number II Given an array of integers, every element appears th

HDU 3068 最長回文 (Manacher算法)   最長回文 Time Limit: 4000/2000 MS (Java/Others)

HDU 3294 Girls' research (Manacher算法 + 記錄區間) Girls research Time Lim

hdu 1016 Prime Ring Problem DFS解法 Prime Ring Problem Time Limit: 4000/2000 MS

UVA - 11987 - Almost Union-Find （又是並查集~） UVA - 11987 Almost Union-Find