[编程练习][Two Sum]<LeetCode-1>
2014-12-01 22:50
423 查看
太久不编程,手会生。最近开始做一些编程题目,用我比较不熟悉的python来写。
Two Sum(题目来自:https://oj.leetcode.com/problems/two-sum/)
Given an array of integers, find two numbers such that they add up to a specific target number.
Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
下面是我的解答(Accepted):
说明:
1) LeetCode 这一题的标注难度是Easy。确实也比较简单;
2)求a + b = target。 我的思路就是构造一个字典,每次检查 target - x 是否在字典里,若不是则把x加入字典。python 对字典的原生支持使得实现非常轻松。
Two Sum(题目来自:https://oj.leetcode.com/problems/two-sum/)
Given an array of integers, find two numbers such that they add up to a specific target number.
Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
下面是我的解答(Accepted):
class Solution: # @return a tuple, (index1, index2) def twoSum(self, num, target): newMap = {} for i in range(len(num)): val = target - num[i] if val in newMap: return (newMap[val], i+1) else: newMap[num[i]] = i + 1
说明:
1) LeetCode 这一题的标注难度是Easy。确实也比较简单;
2)求a + b = target。 我的思路就是构造一个字典,每次检查 target - x 是否在字典里,若不是则把x加入字典。python 对字典的原生支持使得实现非常轻松。
相关文章推荐
- [编程练习]Longest Palindromic Substring <LeetCode-5>
- [编程练习][Add Two Numbers]<LeetCode-2>
- [编程练习]ZigZag Conversion <LeetCode-6>
- [编程练习][Longest Substring Without Repeating Characters]<LeetCode-3>
- Leetcode练习<十二> 判断整数是否为回文
- leetcode题目总结<1>
- <<C和指针>>第1章之编程练习心得20140702
- LeetCode练习<一> 判断大写字母的位置
- <<C和指针>>第1章之编程练习心得20140704
- 网络编程笔记<1>
- Leetcode练习<五> 字符串翻转
- <<C和指针>>第1章之编程练习心得20140703
- Leetcode练习<十三> 判断数据的插入位置
- <<C和指针>>第2章之编程练习心得20140709
- <1>——Two Sum
- Leetcode练习<二十>判断括号的有效性
- Leetcode练习<十一> 整数翻转
- Leetcode练习<二十一>求解整数的平方根
- LeetCode练习<七> 分糖
- Leetcode练习<十七> 合并数组并排序