页面顶部 Top
文件:  root - text - article - 2019 - 10 - find-the-non-duplicate-number.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 256 次阅读, 17018 次搜索 | 60 个单词

定阅此目录的博客 | 浏览 | 博客存档
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.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 256 次阅读, 17018 次搜索 | 60 个单词 定阅此目录的博客

猜您喜欢...

  1. Most Frequent Subtree Sum
  2. Fix Brackets
  3. [Daily Problem] Course Prerequisites
  4. Algorithm Interview Question: Max and Min with Limited Comparisons
  5. Daily Interview Problem: Tree Serialization
  6. Daily Interview Problem: Queue Using Two Stacks
  7. Maximum In A Stack
  8. ImageMagick Vulnerabilities -  CVE-2016–3714
  9. [Daily Problem] Longest Increasing Subsequence
  10. Daily Interview Problem: Largest Product of 3 Elements I

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />