Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Hi, here's your problem today. This problem was recently asked by Apple:

Given an array of integers, arr, where all numbers occur twice except one number which occurs once, find the number. Your solution should ideally be O(n) time and use constant extra space. Example: Input: arr = [7, 3, 5, 5, 4, 3, 4, 8, 8] Output: 7 class Solution(object): def findSingle(self, nums): # Fill this in.

nums = [1, 1, 3, 4, 4, 5, 6, 5, 6] print(Solution().findSingle(nums))

3