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 | 258 Views, 17235 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 | 258 Views, 17235 Search Bots | 60 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Largest BST in a Binary Tree
  2. Spectrum Master
  3. Daily Interview Problem: Largest Product of 3 Elements I
  4. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  5. [Daily Problem] Longest Increasing Subsequence
  6. Daily Interview Problem: Spiral Traversal of Grid
  7. Daily Interview Problem: Full Binary Tree
  8. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  9. Spreadsheet Column Title
  10. Daily Interview Problem: Validate Binary Search Tree

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">