文件: 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, | 英文 | 主页 | 类别: 计算机科学 | 201 次阅读, 30667 次搜索 | 68 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 201 次阅读, 30667 次搜索 | 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
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 201 次阅读, 30667 次搜索 | 68 个单词 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 Puzzle: Ways to Traverse a Grid
- Daily Interview Problem: Spiral Traversal of Grid
- Algorithm Interview Question: H-Index
- Daily Interview Problem: Decode String
- Top K Frequent words
- Daily Interview Problem: Maximum Profit From Stocks
- Progess made
- ImageMagick Vulnerabilities - CVE-2016–3714
- Daily Interview Problem: Jump to the End
- Daily Interview Question: Create a Simple Calculator
©2006~2024 牛排过熟 - 0.01314 秒 - 4140.949 KB/s - 25 在线 内存: 516.63 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。