Package g0201_0300.s0212_word_search_ii

Class Tree

  • All Implemented Interfaces:
    
public final class Tree

    212 - Word Search II.

    Hard

    Given an m x n board of characters and a list of strings words, return all words on the board.

    Each word must be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.

    Example 1:

    Input: board = ["o","a","a","n","e","t","a","e","i","h","k","r","i","f","l","v"], words = "oath","pea","eat","rain"

    Output: "eat","oath"

    Example 2:

    Input: board = ["a","b","c","d"], words = "abcb"

    Output: []

    Constraints:

    • m == board.length

    • n == board[i].length

    • 1 <= m, n <= 12

    • board[i][j] is a lowercase English letter.

    • <code>1 <= words.length <= 3 * 10<sup>4</sup></code>

    • 1 &lt;= words[i].length &lt;= 10

    • words[i] consists of lowercase English letters.

    • All the strings of words are unique.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
      public class Tree.Companion

    • Constructor Summary

      Constructors 
      Constructor Description
      Tree()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String getEnd()
      final Unit setEnd(String end)
      final Tree getChild(Character c)
      final Integer len()

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait