To the Top
File:  root - text - article - 2019 - 10 - find-the-non-duplicate-number.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 310 Views, 18665 Search Bots | 60 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:

Given a list of numbers, where every number shows up twice except for one number, find that one number.

Example:
Input: [4, 3, 2, 4, 1, 3, 2]
Output: 1
Here's the function signature:


def singleNumber(nums):
# Fill this in.

print singleNumber([4, 3, 2, 4, 1, 3, 2])
# 1


Challenge: Find a way to do this using O(1) memory.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 310 Views, 18665 Search Bots | 60 Words Subscribe to Feed Burner

Related Articles

  1. [Daily Problem] Remove k-th Last Element From Linked List
  2. Floor and Ceiling of a Binary Search Tree
  3. Daily Interview Problem: Min Stack
  4. Algorithm Interview: Convert Roman Numerals to Decimal
  5. [Daily Problem] Move Zeros
  6. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  7. Daily Interview Problem: Largest BST in a Binary Tree
  8. Absolute Path
  9. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  10. Daily Interview Problem: Reverse Words in a String

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    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="noindex, follow" />