Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? 题目意思:找出一个数组中的一个不同的元素. 新手想法,先排序,然后循环找出那个前后不一…
def crypt(source,key): from itertools import cycle result='' temp=cycle(key) for ch in source: result=result+chr(ord(ch)^ord(next(temp))) return result source='Jiangxi Insstitute of Busiess and Technology' key='zWrite' print('Before Encrypted:'+sourc…