页面顶部 Top
文件:  root - text - article - 2019 - 10 - find-pythagorean-triplets.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 269 次阅读, 15656 次搜索 | 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.


def findPythagoreanTriplets(nums):
# Fill this in.

print findPythagoreanTriplets([3, 12, 5, 13])
# True
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 269 次阅读, 15656 次搜索 | 57 个单词 定阅此目录的博客

猜您喜欢...

  1. Spreadsheet Columns
  2. [Daily Problem] Validate Balanced Parentheses
  3. Plus One
  4. Daily Interview Problem: First Missing Positive Integer
  5. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  6. Daily Interview Problem: Decode String
  7. Daily Interview Problem: Longest Substring With K Distinct Characters
  8. Design Tic-Tac-Toe
  9. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  10. Daily Interview Question: Longest Sequence with Two Unique Numbers

评论 (0)

    当前页暂时没有评论。


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