文件: root - text - article - 2019 - 10 - find-pythagorean-triplets.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 315 次阅读, 18085 次搜索 | 57 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 315 次阅读, 18085 次搜索 | 57 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Uber:
Given a list of numbers, find if there exists a pythagorean triplet in that list. A pythagorean triplet is 3 variables a, b, c where a^2 + b^2 = c^2
Example:
Input: [3, 5, 12, 5, 13]
Output: True
Here, 5^2 + 12^2 = 13^2.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 315 次阅读, 18085 次搜索 | 57 个单词 Given a list of numbers, find if there exists a pythagorean triplet in that list. A pythagorean triplet is 3 variables a, b, c where a^2 + b^2 = c^2
Example:
Input: [3, 5, 12, 5, 13]
Output: True
Here, 5^2 + 12^2 = 13^2.
def findPythagoreanTriplets(nums):
# Fill this in.
print findPythagoreanTriplets([3, 12, 5, 13])
# True
猜您喜欢...
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- [Daily Problem] Angles of a Clock
- Staying on a Chess Board
- Non-decreasing Array with Single Modification
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
- Daily Interview Question: Edit Distance
- Palindrome Integers
- Patterns for breaking down questions you haven
- First and Last Indices of an Element in a Sorted Array
- Daily Interview Problem: Min Stack
©2006~2024 牛排过熟 - 0.01804 秒 - 2995.625 KB/s - 14 在线 内存: 518.12 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。