# 1181.Before-and-After-Puzzle

## 1181. Before and After Puzzle

## 题目地址

<https://leetcode.com/problems/before-and-after-puzzle/>

## 题目描述

```
Given a list of phrases, generate a list of Before and After puzzles.

A phrase is a string that consists of lowercase English letters and spaces only. No space appears in the start or the end of a phrase. There are no consecutive spaces in a phrase.

Before and After puzzles are phrases that are formed by merging two phrases where the last word of the first phrase is the same as the first word of the second phrase.

Return the Before and After puzzles that can be formed by every two phrases phrases[i] and phrases[j] where i != j. Note that the order of matching two phrases matters, we want to consider both orders.

You should return a list of distinct strings sorted lexicographically.

Example 1:
Input: phrases = ["writing code","code rocks"]
Output: ["writing code rocks"]

Example 2:
Input: phrases = ["mission statement",
                  "a quick bite to eat",
                  "a chip off the old block",
                  "chocolate bar",
                  "mission impossible",
                  "a man on a mission",
                  "block party",
                  "eat my words",
                  "bar of soap"]
Output: ["a chip off the old block party",
         "a man on a mission impossible",
         "a man on a mission statement",
         "a quick bite to eat my words",
         "chocolate bar of soap"]
Example 3:
Input: phrases = ["a","b","a"]
Output: ["a"]

Constraints:
1 <= phrases.length <= 100
1 <= phrases[i].length <= 100
```

## 代码

### Approach #1

```java
class Solution {
  public List<String> beforeAndAfterPuzzles(String[] phrases) {
        int n = phrases.length;
    Map<String, List<Integer>> map = new HashMap<>();
    for (int i = 0; i < n; i++) {
      String head = getHead(phrases[i]);
      if (!map.containsKey(head)) {
        map.put(head, new ArrayList<>());
      }
      map.get(head).add(i);
    }

    Set<String> result = new HashSet<>();
    for (int i = 0; i < n; i++) {
      String tail = getTail(phrases[i]);
      if (map.containsKey(tail)) {
        for (Integer j : map.get(tail)) {
          if (i != j) {
            result.add(phrases[i] + phrases[j].substring(tail.length()));
          }
        }
      }
    }
    List<String> list = new ArrayList(result);
    Collections.sort(list);
    return list;
  }

  static String getHead(String phrase) {
    String array = phrase.split(" ");
    return array[0];
  }

  static String getTail(String phrase) {
    String array = phrase.split(" ");
    return array[array.length - 1];
  }

}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/array/1181.before-and-after-puzzle.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.