页面顶部 Top
文件:  root - text - article - 2019 - 12 - group-words-that-are-anagrams.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 233 次阅读, 17680 次搜索 | 77 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by AirBNB:

Given a list of words, group the words that are anagrams of each other. (An anagram are words made up of the same letters).

Example:

Input: ['abc', 'bcd', 'cba', 'cbd', 'efg']
Output: [['abc', 'cba'], ['bcd', 'cbd'], ['efg']]

Here's a starting point:


import collections

def groupAnagramWords(strs):
# Fill this in.

print groupAnagramWords(['abc', 'bcd', 'cba', 'cbd', 'efg'])
# [['efg'], ['bcd', 'cbd'], ['abc', 'cba']]
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 233 次阅读, 17680 次搜索 | 77 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Longest Substring With K Distinct Characters
  2. [Daily Problem] Validate Balanced Parentheses
  3. Daily Interview Problem: Merge List Of Number Into Ranges
  4. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  5. Daily Interview Problem: Circle of Chained Words
  6. Detect Linked List Cycle
  7. Delphi Dynamic Array
  8. Skip the readings, focus on problems. And use all the hints!
  9. Binary Tree Level with Minimum Sum
  10. Top K Frequent words

评论 (0)

    当前页暂时没有评论。


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