[leetcode][python] 1. Two Sum

使用hash table 的特性(最快可達到O(1) 速度的查找) 來加速，若hash table查找速度為O(1), 此演算法複雜度即為O(n)

leetcode:
https://leetcode.com/problems/two-sum/

python dictionary 使用hash table實作:
https://www.tutorialspoint.com/python/python_hash_table.htm

概念參考:
https://blog.techbridge.cc/2017/01/21/simple-hash-table-intro/

source code:
https://github.com/cy-arduino/leetcode/blob/master/1.%20Two%20Sum.c