To the Top
File:  root - text - article - 2020 - 01 - find-the-single-element-in-an-array-of-duplicates.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 146 Views, 28443 Search Bots | 68 Words

Subscribe to Feed Burner | Browse | Archive
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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 146 Views, 28443 Search Bots | 68 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Validate Binary Search Tree
  2. Consecutive Ones
  3. Floor and Ceiling of a Binary Search Tree
  4. Reverse a Linked List
  5. ImageMagick Vulnerabilities -  CVE-2016–3714
  6. Daily Interview Problem: Merge List Of Number Into Ranges
  7. Algorithm Interview: Maximum Path Sum in Binary Tree
  8. Algorithm Interview: Shifted String
  9. YES!!
  10. Generate All IP Addresses

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">