# [LeetCode] 1. Two Sum_Easy tag: Hash Table 2022年11月24日
0 收藏 414 点赞 4,551 浏览 540 个字

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

`Given nums = [2, 7, 11, 15], target = 9,Because nums + nums = 2 + 7 = 9,return [0, 1].`

1. Constraints

1) exactly one solution, 总是有解, 所以无edge case

2. Ideas

hash table T: O(n) S: O(n)

3. Code

`class Solution:    def twoSum(self, nums, target):        d = {}        for index, num in enumerate(nums):            rem = target - num            if rem in d:                return [d[rem], index]            d[num] = index        ` python开发_常用的python模块及安装方法 Educational Codeforces Round 11 C. Hard Process 二分
C. Hard Process题目连接：http://www.codeforces.com/contest/660/problem/CDes… zengkefu@server1:/usr/src\$ uname -aLinux server1 4.10.0-19-generic #21…  Android调用系统相机、自定义相机、处理大图片
Android调用系统相机和自定义相机实例本博文主要是介绍了android上使用相机进行拍照并显示的两种方式，并且由于涉及到要把拍到的照片显… Struts的使用 