嘛…我自己写的又超时了…
def sad(nums):
c = 0
for i in range(len(nums)):
for j in range(len(nums)):
if nums[i] == nums[j]:
c = c + 1
if c !=2:
return nums[i]
else:
c = 0
以下是大神的答案
classSolution(object):
defsingleNumber(self, nums):
res = 0
for i in nums:
res ^= i
return res
leetcode:136 Question (leetcode:136): Given an array of i...
给定一个整数数组，除了某个元素外其余元素均出现两次。请找出这个只出现一次的元素。备注：你的算法应该是一个线性时间复...
一、题目 二、解题 由于是先做了Single Number II，所以一的解法就有了比较重要的灵感，这里只要异或就...
Leetcode: 136. Single NumberGiven a non-empty array of in...
Unit 1 Practice I LeetCode 136 Single Number Given an arr...
Leetcode python answers for leetcode
Given an array of integers, every element appears twice e...
136. Single Number Given an array of integers, every elem...
136. Single Number https://leetcode.com/problems/single-n...
LeetCode 136.Single Number Given a non-empty array of int...
本文标题：Leetcode - 136 - Python
本文链接：https://www.haomeiwen.com/subject/djqgcftx.html
网友评论