页面顶部 Top
文件:  root - text - article - 2020 - 01 - find-the-single-element-in-an-array-of-duplicates.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 192 次阅读, 29929 次搜索 | 68 个单词

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

猜您喜欢...

  1. Binary Tree Level with Minimum Sum
  2. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  3. Daily Interview Problem: Deepest Node in a Binary Tree
  4. Find Pythagorean Triplets
  5. Algorithm Interview: Subarray With Target Sum
  6. Algorithm Interview: Permutations of numbers
  7. Absolute Path
  8. Design Tic-Tac-Toe
  9. Algorithm Interview Question: H-Index
  10. Daily Interview Problem: Jump to the End

评论 (0)

    当前页暂时没有评论。


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