Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Hi, here’s your problem today. This problem was recently asked by Facebook:

Two words can be ‘chained’ if the last character of the first word is the same as the first character of the second word.

Given a list of words, determine if there is a way to ‘chain’ all the words in a circle.

Example: Input: [‘eggs’, ‘karat’, ‘apple’, ‘snack’, ‘tuna’] Output: True Explanation: The words in the order of [‘apple’, ‘eggs’, ‘snack’, ‘karat’, ‘tuna’] creates a circle of chained words.

Here’s a start:

from collections import defaultdict

def chainedWords(words):

Fill this in.

print chainedWords([‘apple’, ‘eggs’, ‘snack’, ‘karat’, ‘tuna’])