blocks|key|491033|text|算法怎么样？|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|491034|在youtube上，我观看了一次非常有趣的谷歌采访，在那里，编码器使用了这种算法。|491035|entityMap|0|LINK|mutability|MUTABLE|url|https://en.wikipedia.org/wiki/Aho%25E2%2580%2593Corasick_algorithm^0|0|2|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

how is about <a href="https://en.wikipedia.org/wiki/Aho%E2%80%93Corasick_algorithm" rel="nofollow noreferrer">Aho–Corasick_algorithm</a>
On youtube i watched a very interesting google interview where the coder used this algorthm.

blocks|key|2362801|text|这里的关键是获取所有不同的字符组合，这些字符可以从与该数字从左到右顺序中提供的数字相关的字符派生出来。显然，所提供的数量越大，就会有更多的组合。例如，您在文章中提供的26678837的数量可以生成11,664唯一字符组合(字符串词)。|type|unstyled|depth|inlineStyleRanges|offset|length|style|BOLD|entityRanges|data|2362802|+2+++++6+++++6+++++7+++++8+++++8+++++3+++++7
abc+++mno+++mno+++pqrs++tuv+++tuv+++def+++pqrs|code-block|syntax|javascript|2362803|这11,664个生成的字符串单词中的每一个都需要通过一个类型的字典传递，该字典本身可能包含17万(或更多)单词，并检查是否(不区分大小写)相等。这不会是一个过于迅速的过程，因为这相当于对平等的近20亿次检查。这需要大约1分钟，20秒，在我的10岁的桌面Windows盒。|2362804|无论如何，下面提供的方法接受所提供的字符串编号，生成不同的字符组合(字符词)，并将每个字符与所提供的字典(word)文本文件中的单词进行比较。阅读附在该方法上的文档：|2362805|​|2362806|📷|atomic|2362807|2362808|/**
+*+Converts+the+supplied+string+telephone+number+(or+any+string+of+integer+
+*+numbers)+to+possible+words+acquired+from+within+the+supplied+dictionary+
+*+text+file. 
+*+
+*+Specific+digits+relate+to+specific+alpha+characters+as+they+do+in+a+telephone
+*+keypad,+for+example:<pre>
+*+
+*++++++1++++2++++3++++4++++5++++6++++7++++8++++9++++0
+*++++++++++ABC++DEF++GHI++JKL++MNO++PQRS+TUV++WXYZ
+*+</pre>
+*+
+*+Digits+1+and+0+do+not+relate+to+any+alpha+characters.+By+looking+at+the+
+*+above+scale+you+can+see+how+a+number+like+"26678837"+can+generate+11,664+
+*+unique+character+combinations+(string+words).+Each+one+of+these+combinations+
+*+needs+to+be+check+against+the+supplied+dictionary+(or+word)+text+file+to+see
+*+if+matches+a+specific+dictionary+word.+If+it+does+then+we+store+that+word+
+*+and+carry+on+to+the+next+character+combination.+If+the+dictionary+(word)+
+*+text+file+contains+170,000+words+and+there+are+11,664+different+character+
+*+combinations+then+a+simple+calculation+(170,000+x+11,664)+determines+that+
+*+there+will+need+to+be+1,982,880,000+(almost+2+billion)+inspections+done+for+
+*+equality.+Because+of+this,+many+(sometimes+thousands)+of+Executor+Service+
+*+threads+are+used+to+speed+up+the+processing+task.+At+the+end+of+the+day+
+*+however,+task+speed+completely+relies+on+the+speed+of+the+Hard+Disk+Drive+
+*+(HDD)+and+too+many+threads+can+actually+degrade+performance.+It's+a+tough+
+*+balance.+Modify+things+as+you+see+fit.
+*+
+*+
+*+
+*+@param+dictionaryFilePath+(String)+The+path+and+file+name+of+the+dictionary+
+*+file+to+gather+possible+words+from.+This+dictionary+(or+word)+file+must+
+*+contain+a+single+word+on+each+line+of+the+file.+There+can+not+be+more+than+
+*+one+word+on+any+given+file+line.+Blank+lines+within+the+file+are+ignored.+
+*+Letter+case+is+always+ignored+during+processing+however+any+words+found+and+
+*+returned+will+be+in+Upper+Letter+Case. 
+*+
+*+If+you+don't+currently+have+a+dictionary+or+word+text+file+available+then+
+*+you+can+easily+acquire+one+from+the+Internet. 
+*+
+*+@param+telephoneNumber+(String)+The+telephone+number+(or+any+number)+to+
+*+convert+to+a+dictionary+word.+Any+non-digit+characters+within+the+supplied+
+*+string+are+automatically+removed+so+that+only+digits+remain.+The+longer+
+*+the+number+string,+the+longer+it+takes+to+process+this+number+to+a+word.+
+*+There+is+no+guarantee+that+the+number+you+supply+will+produce+a+word+from+
+*+within+the+supplied+dictionary+(word)+file. 
+*+
+*+@param+showProcess+(boolean)+If+boolean+'true'+is+supplied+then+the+processing+
+*+is+displayed+within+the+console+window.+This+however+slows+things+down+
+*+considerably+but+does+give+you+an+idea+what+is+going+on.+Because+larger+
+*+string+numbers+can+take+some+time+to+complete+processing,+a+modal+'Please+
+*+Wait'+dialog+with+a+progress+bar+is+displayed+in+the+middle+of+your+screen.+
+*+When+processing+has+completed+this+dialog+window+is+automatically+closed. 
+*+
+*+@return+(String[]+Array)+A+String[]+Array+of+the+word+or+words+from+the+
+*+supplied+dictionary+(word)+file+which+the+supplied+number+correlates+to.+
+*/
public+static+String[]+telephoneNumberToDictionaryWords(final+String+dictionaryFilePath,+
+++++++++++++++++++++++final+String+telephoneNumber,+final+boolean+showProcess)+{
++++long+timeStart+=+System.currentTimeMillis();
++++if+(dictionaryFilePath+==+null+%7C%7C+dictionaryFilePath.isEmpty())+{
++++++++System.err.println("The+argument+for+dictionaryFilePath+can+not+be+null+or+empty!");
++++++++return+null;
++++}
++++else+if+(telephoneNumber+==+null+%7C%7C+telephoneNumber.trim().isEmpty())+{
++++++++System.err.println("The+argument+for+telephoneNumber+can+not+be+null+or+empty!");
++++++++return+null;
++++}
++++else+if+(!new+File(dictionaryFilePath).exists())+{
++++++++System.err.println("File+Not+Found!+("
++++++++++++++++%2B+new+File(dictionaryFilePath).getAbsolutePath()+%2B+")");
++++++++return+null;
++++}
++++String+digits+=+String.valueOf(telephoneNumber).replaceAll("[%5E\\d]",+"");
++++if+(digits.isEmpty())+{
++++++++return+null;
++++}
++++List<String>+foundList+=+new+ArrayList<>();
++++
++++//+==================+The+'Please+Wait'+Dialog+Window+==================
++++//+Depending+on+the+number+supplied,+this+process+can+take+a+while+to+
++++//+complete+therefore+put+a+popup+'Please+Wait...'+window+into+play+
++++//+here.
++++final+javax.swing.JFrame+iframe+=+new+javax.swing.JFrame();
++++iframe.setAlwaysOnTop(true);
++++iframe.setDefaultCloseOperation(JFrame.DISPOSE_ON_CLOSE);
++++iframe.setLocationRelativeTo(null);
++++
++++final+JDialog+workingDialog+=+new+JDialog(iframe);
++++workingDialog.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.WAIT_CURSOR));
++++final+JPanel+p1+=+new+JPanel(new+BorderLayout());
++++javax.swing.border.Border+lineBorder+=+javax.swing.BorderFactory.createLineBorder(Color.red,+4);
++++p1.setBorder(lineBorder);
++++p1.setBackground(Color.BLACK);
++++p1.setPreferredSize(new+java.awt.Dimension(255,+150));
++++
++++final+JLabel+label+=+new+JLabel();
++++label.setHorizontalAlignment(JLabel.CENTER);
++++label.setVerticalAlignment(JLabel.CENTER);
++++label.setText("<html><font+size='5',color=#14e5eb><center>Please+Wait..."
++++++++++++++++++%2B+"</center> <center>This+can+take+a+little+"
++++++++++++++++++%2B+"while.</center></html>");
++++label.setForeground(Color.WHITE);
++++p1.add(label,+BorderLayout.CENTER);
++++
++++final+JLabel+label2+=+new+JLabel();
++++label2.setHorizontalAlignment(JLabel.CENTER);
++++label2.setVerticalAlignment(JLabel.CENTER);
++++label2.setText("Hello+World");
++++label2.setForeground(Color.WHITE);
++++p1.add(label2,+BorderLayout.BEFORE_FIRST_LINE);
+++++++++++
++++final+javax.swing.JProgressBar+progressBar+=+new+javax.swing.JProgressBar();
++++progressBar.setPreferredSize(+new+java.awt.Dimension+(190,+25));
++++progressBar.setMaximumSize(new+java.awt.Dimension(190,25));
++++progressBar.setStringPainted(true);
++++p1.add(progressBar,+BorderLayout.SOUTH);
++++
++++workingDialog.setUndecorated(true);
++++workingDialog.getContentPane().add(p1);
++++workingDialog.pack();
++++workingDialog.setLocationRelativeTo(iframe);
++++workingDialog.setDefaultCloseOperation(JDialog.DISPOSE_ON_CLOSE);
++++workingDialog.setModal(true);
++++//+=====================================================================

++++SwingWorker<String,+Void>+worker+=+new+SwingWorker<String,+Void>()+{
++++++++@Override
++++++++protected+String+doInBackground()+throws+InterruptedException+{
++++++++++++//+Get+the+number+of+words+contained+within+the+supplied+dictionary+file.
++++++++++++long+numberOfDictionaryWords+=+0L;
++++++++++++//+This+will+auto-close+the+stream.
++++++++++++try+(java.util.stream.Stream<String>+linesStream
++++++++++++++++++++=+java.nio.file.Files.lines(java.nio.file.Paths.get(dictionaryFilePath)))+{
++++++++++++++++numberOfDictionaryWords+=+linesStream.count();
++++++++++++}
++++++++++++catch+(IOException+ex)+{
++++++++++++++++System.err.println(ex);
++++++++++++}
++++++++++++if+(showProcess)+{
++++++++++++++++System.out.println("The+number+of+words+in+dictionary:+-->+"+
++++++++++++++++++++++++++++++++++%2B+numberOfDictionaryWords);
++++++++++++}

++++++++++++//+Map+the+alpha+characters+related+to+telephone+digits
++++++++++++HashMap<Character,+String>+map+=+new+HashMap<>();
++++++++++++map.put('0',+"");
++++++++++++map.put('1',+"");
++++++++++++map.put('2',+"abc");
++++++++++++map.put('3',+"def");
++++++++++++map.put('4',+"ghi");
++++++++++++map.put('5',+"jkl");
++++++++++++map.put('6',+"mno");
++++++++++++map.put('7',+"pqrs");
++++++++++++map.put('8',+"tuv");
++++++++++++map.put('9',+"wxyz");

++++++++++++//+Get+all+the+character+combinations+available+for+the
++++++++++++//+telelphone+number+(or+just+number)+digits+provided.
++++++++++++List<String>+phoneCharactersList+=+new+ArrayList<>();
++++++++++++phoneCharactersList.add("");
++++++++++++for+(int+i+=+0;+i+<+digits.length();+i%2B%2B)+{
++++++++++++++++if+(digits.charAt(i)+==+'0'+%7C%7C+digits.charAt(i)+==+'1')+{
++++++++++++++++++++continue;
++++++++++++++++}
++++++++++++++++ArrayList<String>+tempList+=+new+ArrayList<>();

++++++++++++++++String+option+=+map.get(digits.charAt(i));

++++++++++++++++for+(int+j+=+0;+j+<+phoneCharactersList.size();+j%2B%2B)+{
++++++++++++++++++++for+(int+p+=+0;+p+<+option.length();+p%2B%2B)+{
++++++++++++++++++++++++tempList.add(new+StringBuilder(phoneCharactersList.get(j))
++++++++++++++++++++++++++++++++.append(option.charAt(p)).toString());
++++++++++++++++++++}
++++++++++++++++}
++++++++++++++++phoneCharactersList.clear();
++++++++++++++++phoneCharactersList.addAll(tempList);
++++++++++++}
++++++++++++if+(showProcess)+{
++++++++++++++++System.out.println("The+number+of+generated+words+to+process:+-->+"
++++++++++++++++++++++++++++++++++%2B+phoneCharactersList.size());
++++++++++++}
++++++++++++
++++++++++++progressBar.setMinimum(0);
++++++++++++progressBar.setMaximum(phoneCharactersList.size());
++++++++++++
++++++++++++/*+Iterate+through+all+the+character+combinations+now+contained
+++++++++++++++within+the+'phoneCharactersList'+and+compare+them+to+the+words
+++++++++++++++contained+within+the+dictionary+file.+Store+found+words+into+
+++++++++++++++the+foundList+List+Interface+object.+
+++++++++++++++Declare+concurrent+executor+service+threads+(one+for+each+possible+
+++++++++++++++word+to+check+for+in+dictionary+file).++++++*/
++++++++++++java.util.concurrent.ExecutorService+executor+=+
++++++++++++++++++++java.util.concurrent.Executors.newFixedThreadPool(phoneCharactersList.size());
++++++++++++for+(int+i+=+0;+i+<+phoneCharactersList.size();+i%2B%2B)+{
++++++++++++++++String+wordToFind+=+phoneCharactersList.get(i);
++++++++++++++++label2.setText("<html><center>Processing+word:+<font+color=yellow>"+
+++++++++++++++++++++++++++++++%2B+wordToFind+%2B+"</center></html>");
++++++++++++++++if+(showProcess)+{
++++++++++++++++++++System.out.println((i+%2B+1)+%2B+")+Processing+the+possible+word:+"+%2B+wordToFind);
++++++++++++++++}
++++++++++++++++Runnable+threadWorker+=+new+Runnable()+{
++++++++++++++++++++@Override
++++++++++++++++++++public+void+run()+{
++++++++++++++++++++++++try+(java.io.BufferedReader+br+=+new+java.io.BufferedReader(new+java.io.FileReader(dictionaryFilePath)))+{
++++++++++++++++++++++++++++String+line;
++++++++++++++++++++++++++++while+((line+=+br.readLine())+!=+null)+{
++++++++++++++++++++++++++++++++line+=+line.trim();
++++++++++++++++++++++++++++++++if+(line.isEmpty()+%7C%7C+(line.length()+!=+wordToFind.length()))+{
++++++++++++++++++++++++++++++++++++continue;
++++++++++++++++++++++++++++++++}
++++++++++++++++++++++++++++++++if+(line.equalsIgnoreCase(wordToFind))+{
++++++++++++++++++++++++++++++++++++foundList.add(wordToFind.toUpperCase());
++++++++++++++++++++++++++++++++++++break;
++++++++++++++++++++++++++++++++}
++++++++++++++++++++++++++++}
++++++++++++++++++++++++}
++++++++++++++++++++++++catch+(Exception+ex)+{
++++++++++++++++++++++++++++System.err.println(ex);
++++++++++++++++++++++++}
++++++++++++++++++++}
++++++++++++++++};
++++++++++++++++executor.execute(threadWorker);
++++++++++++++++progressBar.setValue(i%2B1);
++++++++++++}
++++++++++++//+Shut+down+Executor+Service+threads+(when+they+are+done)
++++++++++++executor.shutdown();
++++++++++++//+Hold+rest+of+code+processing+until+are+executors+are+terminated.
++++++++++++while+(!executor.isTerminated())+{
++++++++++++}

++++++++++++return+null;
++++++++}

++++++++@Override
++++++++protected+void+done()+{
++++++++++++workingDialog.dispose();
++++++++++++iframe.dispose();
++++++++++++workingDialog.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.DEFAULT_CURSOR));
++++++++}
++++};
++++worker.execute();
++++workingDialog.setVisible(true);
++++try+{
++++++++worker.get();
++++}
++++catch+(Exception+e1)+{
++++++++e1.printStackTrace();
++++}
++++
++++java.util.Collections.sort(foundList);
++++long+timeEnd+=+System.currentTimeMillis();
++++if+(showProcess)+{
++++++++long+seconds+=+(timeEnd+-+timeStart)+/+1000;
++++++++String+timeSpan+=+new+StringBuffer("").append(String.valueOf(seconds))
++++++++++++++++++++++++++++++++++++.append("+seconds").toString();
++++++++if+(seconds+>+60)+{
++++++++++++timeSpan+=+new+StringBuffer("").append(String.valueOf(seconds/60))
++++++++++++++++++++++++.append("+minutes+and+").append(String.valueOf(seconds%2560))
++++++++++++++++++++++++.append("+seconds").toString();
++++++++}
++++++++System.out.println(new+StringBuffer("It+took+").append(timeSpan)
++++++++++++++++.append("+to+process+the+number:+").append(telephoneNumber)
++++++++++++++++.toString());
++++}
++++return+foundList.toArray(new+String[foundList.size()]);
}|2362809|根据需要修改代码，以便利用2-3-4树、B树或任何您喜欢的东西。要使用此方法，您可以这样做：|2362810|String+phoneNumber+=+"26678837";
String[]+words+=+telephoneNumberToDictionaryWords("dictionary.txt",+phoneNumber,+false);
if+(words+==+null+%7C%7C+words.length+==+0)+{
++++System.out.println("There+are+no+dictionary+words+available+for+"
++++++++++++%2B+"the+Phone+Number:+"+%2B+phoneNumber);
}
else+{
++++for+(String+str+:+words)+{
++++++++System.out.println(str);
++++}
}|2362811|entityMap|0|IMAGE|mutability|IMMUTABLE|imageUrl|https://developer.qcloudimg.com/http-save/yehe-900000/7ccaefc29d9f2390bc188e29beafbb82.gif|imageAlt^0|2B|8|2Q|6|0|0|0|0|0|0|1|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|19|8|@$9|1A|A|1B|B|C]|$9|1C|A|1D|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|1E|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|1F|8|@]|D|@]|E|$]]|$1|M|3|N|5|6|7|1G|8|@]|D|@]|E|$]]|$1|O|3|P|5|6|7|1H|8|@]|D|@]|E|$]]|$1|Q|3|R|5|S|7|1I|8|@]|D|@$9|1J|A|1K|1|1L]]|E|$]]|$1|T|3|P|5|6|7|1M|8|@]|D|@]|E|$]]|$1|U|3|V|5|H|7|1N|8|@]|D|@]|E|$I|J]]|$1|W|3|X|5|6|7|1O|8|@]|D|@]|E|$]]|$1|Y|3|Z|5|H|7|1P|8|@]|D|@]|E|$I|J]]|$1|10|3|-4|5|6|7|1Q|8|@]|D|@]|E|$]]]|11|$12|$5|13|14|15|E|$16|17|18|-4]]]]

The key here would be to acquire all the different character combinations that can derive from the characters related to the supplied number in the left to right sequence of that number. Obviously the larger the supplied number, the more combinations there will be. The number of 26678837 which you provided in your post for example can generate 11,664 unique character combinations (string words).
<pre><code> 2 6 6 7 8 8 3 7
abc mno mno pqrs tuv tuv def pqrs
</code></pre>
Each one of these 11,664 generated string words would need to be passed through a dictionary of sorts which in itself may contain let's say 170,000 (or more) words and checked for (case insensitive) equality. This is not going to be an overly quick process since that equates to almost 2 billion inspections for equality. This takes about 1 minute, 20 seconds on my 10 year old desktop Windows box.
In any case the method provided below takes the supplied string number, generates the different character combinations (character words) and compares each one against the words within the supplied dictionary (word) text file. Read the doc's that are attached to the method:
<a href="https://i.stack.imgur.com/AOxzw.gif" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/AOxzw.gif" alt="enter image description here" /></a>
<pre><code>/**
 * Converts the supplied string telephone number (or any string of integer 
 * numbers) to possible words acquired from within the supplied dictionary 
 * text file.&lt;br&gt;&lt;br&gt;
 * 
 * Specific digits relate to specific alpha characters as they do in a telephone
 * keypad, for example:&lt;pre&gt;
 * 
 * 1 2 3 4 5 6 7 8 9 0
 * ABC DEF GHI JKL MNO PQRS TUV WXYZ
 * &lt;/pre&gt;
 * 
 * Digits 1 and 0 do not relate to any alpha characters. By looking at the 
 * above scale you can see how a number like &quot;26678837&quot; can generate 11,664 
 * unique character combinations (string words). Each one of these combinations 
 * needs to be check against the supplied dictionary (or word) text file to see
 * if matches a specific dictionary word. If it does then we store that word 
 * and carry on to the next character combination. If the dictionary (word) 
 * text file contains 170,000 words and there are 11,664 different character 
 * combinations then a simple calculation (170,000 x 11,664) determines that 
 * there will need to be 1,982,880,000 (almost 2 billion) inspections done for 
 * equality. Because of this, many (sometimes thousands) of Executor Service 
 * threads are used to speed up the processing task. At the end of the day 
 * however, task speed completely relies on the speed of the Hard Disk Drive 
 * (HDD) and too many threads can actually degrade performance. It's a tough 
 * balance. Modify things as you see fit.
 * 
 * 
 * 
 * @param dictionaryFilePath (String) The path and file name of the dictionary 
 * file to gather possible words from. This dictionary (or word) file must 
 * contain a single word on each line of the file. There can not be more than 
 * one word on any given file line. Blank lines within the file are ignored. 
 * Letter case is always ignored during processing however any words found and 
 * returned will be in Upper Letter Case.&lt;br&gt;&lt;br&gt;
 * 
 * If you don't currently have a dictionary or word text file available then 
 * you can easily acquire one from the Internet.&lt;br&gt;
 * 
 * @param telephoneNumber (String) The telephone number (or any number) to 
 * convert to a dictionary word. Any non-digit characters within the supplied 
 * string are automatically removed so that only digits remain. The longer 
 * the number string, the longer it takes to process this number to a word. 
 * There is no guarantee that the number you supply will produce a word from 
 * within the supplied dictionary (word) file.&lt;br&gt;
 * 
 * @param showProcess (boolean) If boolean 'true' is supplied then the processing 
 * is displayed within the console window. This however slows things down 
 * considerably but does give you an idea what is going on. Because larger 
 * string numbers can take some time to complete processing, a modal 'Please 
 * Wait' dialog with a progress bar is displayed in the middle of your screen. 
 * When processing has completed this dialog window is automatically closed.&lt;br&gt;
 * 
 * @return (String[] Array) A String[] Array of the word or words from the 
 * supplied dictionary (word) file which the supplied number correlates to. 
 */
public static String[] telephoneNumberToDictionaryWords(final String dictionaryFilePath, 
 final String telephoneNumber, final boolean showProcess) {
 long timeStart = System.currentTimeMillis();
 if (dictionaryFilePath == null || dictionaryFilePath.isEmpty()) {
 System.err.println(&quot;The argument for dictionaryFilePath can not be null or empty!&quot;);
 return null;
 }
 else if (telephoneNumber == null || telephoneNumber.trim().isEmpty()) {
 System.err.println(&quot;The argument for telephoneNumber can not be null or empty!&quot;);
 return null;
 }
 else if (!new File(dictionaryFilePath).exists()) {
 System.err.println(&quot;File Not Found! (&quot;
 + new File(dictionaryFilePath).getAbsolutePath() + &quot;)&quot;);
 return null;
 }
 String digits = String.valueOf(telephoneNumber).replaceAll(&quot;[^\\d]&quot;, &quot;&quot;);
 if (digits.isEmpty()) {
 return null;
 }
 List&lt;String&gt; foundList = new ArrayList&lt;&gt;();
 
 // ================== The 'Please Wait' Dialog Window ==================
 // Depending on the number supplied, this process can take a while to 
 // complete therefore put a popup 'Please Wait...' window into play 
 // here.
 final javax.swing.JFrame iframe = new javax.swing.JFrame();
 iframe.setAlwaysOnTop(true);
 iframe.setDefaultCloseOperation(JFrame.DISPOSE_ON_CLOSE);
 iframe.setLocationRelativeTo(null);
 
 final JDialog workingDialog = new JDialog(iframe);
 workingDialog.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.WAIT_CURSOR));
 final JPanel p1 = new JPanel(new BorderLayout());
 javax.swing.border.Border lineBorder = javax.swing.BorderFactory.createLineBorder(Color.red, 4);
 p1.setBorder(lineBorder);
 p1.setBackground(Color.BLACK);
 p1.setPreferredSize(new java.awt.Dimension(255, 150));
 
 final JLabel label = new JLabel();
 label.setHorizontalAlignment(JLabel.CENTER);
 label.setVerticalAlignment(JLabel.CENTER);
 label.setText(&quot;&lt;html&gt;&lt;font size='5',color=#14e5eb&gt;&lt;b&gt;&lt;center&gt;Please Wait...&quot;
 + &quot;&lt;/center&gt;&lt;/b&gt;&lt;/font&gt;&lt;br&gt;&lt;center&gt;This can take a little &quot;
 + &quot;while.&lt;/center&gt;&lt;/html&gt;&quot;);
 label.setForeground(Color.WHITE);
 p1.add(label, BorderLayout.CENTER);
 
 final JLabel label2 = new JLabel();
 label2.setHorizontalAlignment(JLabel.CENTER);
 label2.setVerticalAlignment(JLabel.CENTER);
 label2.setText(&quot;Hello World&quot;);
 label2.setForeground(Color.WHITE);
 p1.add(label2, BorderLayout.BEFORE_FIRST_LINE);
 
 final javax.swing.JProgressBar progressBar = new javax.swing.JProgressBar();
 progressBar.setPreferredSize( new java.awt.Dimension (190, 25));
 progressBar.setMaximumSize(new java.awt.Dimension(190,25));
 progressBar.setStringPainted(true);
 p1.add(progressBar, BorderLayout.SOUTH);
 
 workingDialog.setUndecorated(true);
 workingDialog.getContentPane().add(p1);
 workingDialog.pack();
 workingDialog.setLocationRelativeTo(iframe);
 workingDialog.setDefaultCloseOperation(JDialog.DISPOSE_ON_CLOSE);
 workingDialog.setModal(true);
 // =====================================================================

 SwingWorker&lt;String, Void&gt; worker = new SwingWorker&lt;String, Void&gt;() {
 @Override
 protected String doInBackground() throws InterruptedException {
 // Get the number of words contained within the supplied dictionary file.
 long numberOfDictionaryWords = 0L;
 // This will auto-close the stream.
 try (java.util.stream.Stream&lt;String&gt; linesStream
 = java.nio.file.Files.lines(java.nio.file.Paths.get(dictionaryFilePath))) {
 numberOfDictionaryWords = linesStream.count();
 }
 catch (IOException ex) {
 System.err.println(ex);
 }
 if (showProcess) {
 System.out.println(&quot;The number of words in dictionary: --&gt; &quot; 
 + numberOfDictionaryWords);
 }

 // Map the alpha characters related to telephone digits
 HashMap&lt;Character, String&gt; map = new HashMap&lt;&gt;();
 map.put('0', &quot;&quot;);
 map.put('1', &quot;&quot;);
 map.put('2', &quot;abc&quot;);
 map.put('3', &quot;def&quot;);
 map.put('4', &quot;ghi&quot;);
 map.put('5', &quot;jkl&quot;);
 map.put('6', &quot;mno&quot;);
 map.put('7', &quot;pqrs&quot;);
 map.put('8', &quot;tuv&quot;);
 map.put('9', &quot;wxyz&quot;);

 // Get all the character combinations available for the
 // telelphone number (or just number) digits provided.
 List&lt;String&gt; phoneCharactersList = new ArrayList&lt;&gt;();
 phoneCharactersList.add(&quot;&quot;);
 for (int i = 0; i &lt; digits.length(); i++) {
 if (digits.charAt(i) == '0' || digits.charAt(i) == '1') {
 continue;
 }
 ArrayList&lt;String&gt; tempList = new ArrayList&lt;&gt;();

 String option = map.get(digits.charAt(i));

 for (int j = 0; j &lt; phoneCharactersList.size(); j++) {
 for (int p = 0; p &lt; option.length(); p++) {
 tempList.add(new StringBuilder(phoneCharactersList.get(j))
 .append(option.charAt(p)).toString());
 }
 }
 phoneCharactersList.clear();
 phoneCharactersList.addAll(tempList);
 }
 if (showProcess) {
 System.out.println(&quot;The number of generated words to process: --&gt; &quot;
 + phoneCharactersList.size());
 }
 
 progressBar.setMinimum(0);
 progressBar.setMaximum(phoneCharactersList.size());
 
 /* Iterate through all the character combinations now contained
 within the 'phoneCharactersList' and compare them to the words
 contained within the dictionary file. Store found words into 
 the foundList List Interface object. 
 Declare concurrent executor service threads (one for each possible 
 word to check for in dictionary file). */
 java.util.concurrent.ExecutorService executor = 
 java.util.concurrent.Executors.newFixedThreadPool(phoneCharactersList.size());
 for (int i = 0; i &lt; phoneCharactersList.size(); i++) {
 String wordToFind = phoneCharactersList.get(i);
 label2.setText(&quot;&lt;html&gt;&lt;center&gt;Processing word: &lt;font color=yellow&gt;&quot; 
 + wordToFind + &quot;&lt;/font&gt;&lt;/center&gt;&lt;/html&gt;&quot;);
 if (showProcess) {
 System.out.println((i + 1) + &quot;) Processing the possible word: &quot; + wordToFind);
 }
 Runnable threadWorker = new Runnable() {
 @Override
 public void run() {
 try (java.io.BufferedReader br = new java.io.BufferedReader(new java.io.FileReader(dictionaryFilePath))) {
 String line;
 while ((line = br.readLine()) != null) {
 line = line.trim();
 if (line.isEmpty() || (line.length() != wordToFind.length())) {
 continue;
 }
 if (line.equalsIgnoreCase(wordToFind)) {
 foundList.add(wordToFind.toUpperCase());
 break;
 }
 }
 }
 catch (Exception ex) {
 System.err.println(ex);
 }
 }
 };
 executor.execute(threadWorker);
 progressBar.setValue(i+1);
 }
 // Shut down Executor Service threads (when they are done)
 executor.shutdown();
 // Hold rest of code processing until are executors are terminated.
 while (!executor.isTerminated()) {
 }

 return null;
 }

 @Override
 protected void done() {
 workingDialog.dispose();
 iframe.dispose();
 workingDialog.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.DEFAULT_CURSOR));
 }
 };
 worker.execute();
 workingDialog.setVisible(true);
 try {
 worker.get();
 }
 catch (Exception e1) {
 e1.printStackTrace();
 }
 
 java.util.Collections.sort(foundList);
 long timeEnd = System.currentTimeMillis();
 if (showProcess) {
 long seconds = (timeEnd - timeStart) / 1000;
 String timeSpan = new StringBuffer(&quot;&quot;).append(String.valueOf(seconds))
 .append(&quot; seconds&quot;).toString();
 if (seconds &gt; 60) {
 timeSpan = new StringBuffer(&quot;&quot;).append(String.valueOf(seconds/60))
 .append(&quot; minutes and &quot;).append(String.valueOf(seconds%60))
 .append(&quot; seconds&quot;).toString();
 }
 System.out.println(new StringBuffer(&quot;It took &quot;).append(timeSpan)
 .append(&quot; to process the number: &quot;).append(telephoneNumber)
 .toString());
 }
 return foundList.toArray(new String[foundList.size()]);
}
</code></pre>
Modify the code as you see fit so as to utilize your 2-3-4 Tree, B-Tree, or whatever you like. To use this method you might do it like this:
<pre><code>String phoneNumber = &quot;26678837&quot;;
String[] words = telephoneNumberToDictionaryWords(&quot;dictionary.txt&quot;, phoneNumber, false);
if (words == null || words.length == 0) {
 System.out.println(&quot;There are no dictionary words available for &quot;
 + &quot;the Phone Number: &quot; + phoneNumber);
}
else {
 for (String str : words) {
 System.out.println(str);
 }
}
</code></pre>

I have a dictionary of words put in an 2-3-4 tree. Words have different lengths. Using a telephone keypad i need to find all possible words that can be responding to a specific phone number. Given the keypad:
<a href="https://i.stack.imgur.com/HqU4E.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/HqU4E.png" alt="keypad" /></a>
for instance the number 26678837 could be the word &quot;COMPUTER&quot; but could also be another word. Given the fact that i have all my words in a 2-3-4 tree what would be the best algorithm or just way of searching in order to find all the possible words from a given phone number?

Search for words with telephone numbers from 2-3-4 tree

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我有一本单词字典放在一个2-3-4树中.单词有不同的长度。使用电话键盘，我需要找到，所有可能的单词，，可以响应特定的电话号码。考虑到键盘：​​例如，数字26678837可以是“计算机”，但也可以是另一个词。考虑到我把所有的单词都放在2-3-4树中，为了从一个给定的电话号码中找到所有可能的单词，什么是最好的算法或者仅仅是...

问从2-3-4树中搜索带有电话号码的单词
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问从2-3-4树中搜索带有电话号码的单词EN