problem0745

README

745. Prefix and Suffix Search

题目

Given many words, words[i] has weight i.

Design a class WordFilter that supports one function, WordFilter.f(String prefix, String suffix). It will return the word with given prefix and suffix with maximum weight. If no word exists, return -1.

Examples:

Input:
WordFilter(["apple"])
WordFilter.f("a", "e") // returns 0
WordFilter.f("b", "") // returns -1

Note:

1. words has length in range [1, 15000].
2. For each test case, up to words.length queries WordFilter.f may be made.
3. words[i] has length in range [1, 10].
4. prefix, suffix have lengths in range [0, 10].
5. words[i] and prefix, suffix queries consist of lowercase letters only.

解题思路

见程序注释

Documentation

Index

• type WordFilter
  • func Constructor(words []string) WordFilter
  • func (w *WordFilter) F(prefix, suffix string) int

Types

type WordFilter

type WordFilter struct {
	// contains filtered or unexported fields
}

WordFilter 是字符过滤器

func Constructor

func Constructor(words []string) WordFilter

Constructor 返回 WordFilter

func (*WordFilter) F

func (w *WordFilter) F(prefix, suffix string) int

F 用于查找同时拥有前缀和后缀的单词的索引号，同时存在多个符合条件的单词的话，返回其中的最大值