c*****n
发帖数: 95 | 1 前面一大堆背景 + Paper
System Design:
How do you adapt a speech recognition system to a specific user, and how to
do it dynamically.
算法:
1. Given N words, and a string X, decide whether X is an anagram of any of
those N words
follow up:
Find whether X consists of multiple anagrams: you can splice the X in any
different ways: e.g.
"abcde" can be divided into ("abc", "de") ("ac", "bde") ("abce", "d") ...... | g**u
发帖数: 583 | 2
to
那每一个char都可以认为是anagram么？如果是的话，是不是所有的都是可以认为都是
anagram了？
如果不是的话，那么按照anagram对称的原则，把所有的char scan一边，然后count每
个char出现的次数，有仅有一个char出现是奇数，所有其他都是偶数的话，那么就可以
把它分为一个anagram？
【在 c*****n 的大作中提到】
: 前面一大堆背景 + Paper
: System Design:
: How do you adapt a speech recognition system to a specific user, and how to
: do it dynamically.
: 算法:
: 1. Given N words, and a string X, decide whether X is an anagram of any of
: those N words
: follow up:
: Find whether X consists of multiple anagrams: you can splice the X in any
: different ways: e.g.
| w***n
发帖数: 58 | 3 算法第一问 linear algebra 第二问dp？ |
|
