1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
package leetcode

import scala.collection.{immutable, mutable}

/*
Design a search autocomplete system for a search engine. Users may input a sentence (at least one word and end with a special character '#'). For each character they type except '#', you need to return the top 3 historical hot sentences that have prefix the same as the part of sentence already typed. Here are the specific rules:

The hot degree for a sentence is defined as the number of times a user typed the exactly same sentence before.
The returned top 3 hot sentences should be sorted by hot degree (The first is the hottest one). If several sentences have the same degree of hot, you need to use ASCII-code order (smaller one appears first).
If less than 3 hot sentences exist, then just return as many as you can.
When the input is a special character, it means the sentence ends, and in this case, you need to return an empty list.
Your job is to implement the following functions:

The constructor function:

AutocompleteSystem(String[] sentences, int[] times): This is the constructor. The input is historical data. Sentences is a string array consists of previously typed sentences. Times is the corresponding times a sentence has been typed. Your system should record these historical data.

Now, the user wants to input a new sentence. The following function will provide the next character the user types:

List<String> input(char c): The input c is the next character typed by the user. The character will only be lower-case letters ('a' to 'z'), blank space (' ') or a special character ('#'). Also, the previously typed sentence should be recorded in your system. The output will be the top 3 historical hot sentences that have prefix the same as the part of sentence already typed.


Example:
Operation: AutocompleteSystem(["i love you", "island","ironman", "i love leetcode"], [5,3,2,2])
The system have already tracked down the following sentences and their corresponding times:
"i love you" : 5 times
"island" : 3 times
"ironman" : 2 times
"i love leetcode" : 2 times
Now, the user begins another search:

Operation: input('i')
Output: ["i love you", "island","i love leetcode"]
Explanation:
There are four sentences that have prefix "i". Among them, "ironman" and "i love leetcode" have same hot degree. Since ' ' has ASCII code 32 and 'r' has ASCII code 114, "i love leetcode" should be in front of "ironman". Also we only need to output top 3 hot sentences, so "ironman" will be ignored.

Operation: input(' ')
Output: ["i love you","i love leetcode"]
Explanation:
There are only two sentences that have prefix "i ".

Operation: input('a')
Output: []
Explanation:
There are no sentences that have prefix "i a".

Operation: input('#')
Output: []
Explanation:
The user finished the input, the sentence "i a" should be saved as a historical sentence in system. And the following input will be counted as a new search.

Note:
The input sentence will always start with a letter and end with '#', and only one blank space will exist between two words.
The number of complete sentences that to be searched won't exceed 100. The length of each sentence including those in the historical data won't exceed 100.
Please use double-quote instead of single-quote when you write test cases even for a character input.
Please remember to RESET your class variables declared in class AutocompleteSystem, as static/class variables are persisted across multiple test cases. Please see here for more details.
 */

object DesignSearchAutoCompleteSystem_642 extends App {

  val as = new AutocompleteSystem(
                                  //    Array("i love you", "island", "iroman", "i love leetcode"),
                                  Array("abc", "abbc", "a"),
                                  Array(3, 3, 3))
  println(as.input('b').mkString("[", ", ", "]"))
  println(as.input('c').mkString("[", ", ", "]"))
  println(as.input('#').mkString("[", ", ", "]"))
  println(as.input('b').mkString("[", ", ", "]"))
  println(as.input('c').mkString("[", ", ", "]"))
  println(as.input('#').mkString("[", ", ", "]"))
  println(as.input('a').mkString("[", ", ", "]"))
  println(as.input('b').mkString("[", ", ", "]"))
  println(as.input('c').mkString("[", ", ", "]"))
  println(as.input('#').mkString("[", ", ", "]"))

  class AutocompleteSystem(_sentences: Array[String], _times: Array[Int]) {
    var freq = new immutable.HashMap[String, Int]
    _sentences.zip(_times).foreach {
      case (s, t) => freq += (s -> (freq.getOrElse(s, 0) + t))
    }

    var data = new StringBuilder

    def input(c: Char): List[String] = {
      if (c == '#') {
        // try to use toString and to[String] , learn it
        freq += (data.toString -> (freq.getOrElse(data.toString, 0) + 1))
        data.clear
        // if no match, return emply list
        return List[String]()
      }
      data += c

      val pq = mutable.PriorityQueue[(String, Int)]()(Ordering.by {
        // in scala, by default, PQ is a max heap
        // first compare times, sort the appear time ascending, then compare string, sort the string descending
        // notice the "-t" ordering, the word appear few times, or the word alphabetical greater, woudl be on top
        // and deque firstly
        case (s, t) => (-t, s)
      })

      for ((s, t) <- freq) {
        var matched = true
        import scala.util.control.Breaks._
        breakable { // notice the usage of breakable
          for (i <- 0 to data.length - 1) {
            // bugfixed
            if (i >= s.length || (i < s.length && data(i) != s.charAt(i))) {
              matched = false
              break
            }
          }
        }
        if (matched) {
          pq += (s -> t)
          if (pq.length > 3) {
            pq.dequeue()
          }

        }
      }

      var res: List[String] = List()
      while (!pq.isEmpty) {
        res = pq.dequeue()._1 :: res
      }

      res

    }

  }

}

see the results:

result