def gen_random(nodes, k):
building_matrix = dok_matrix((nodes, nodes))
for node in xrange(nodes):
k_ns = set([node])
while node in k_ns or len(k_ns) < 3:
k_ns = set(list(random_integers(0, nodes - 1, k)))
for index in k_ns:
building_matrix[node, index] = 1
return building_matrix.tocsr()
import numpy from numpy.random.mtrand import random_integers k = random_integers(1, 500, 1) print k
import numpy from numpy.random.mtrand import random_integers k = random_integers(1, 500, 1) print k
from numpy import *
from numpy.random.mtrand import random_integers
class Solution(object):
@staticmethod
def twoSum(nums, target):
# 如果使用暴力法 复杂度书n^2,会报超时
"""
本例使用空间换时间的方法
:param nums:
:param target:
:return:
"""
result_dict = {}
for i, item in enumerate(nums):
sum_key = target - item
if sum_key in result_dict.keys():
return result_dict[sum_key], i
else:
result_dict[item] = i
if __name__ == "__main__":
data_to_test = list(random_integers(1, 100, 1000))
print(data_to_test)
print(Solution.twoSum(data_to_test, 121))
