Word combination and arrangement method and device, mobile terminal and storage medium
A storage medium and word technology, applied in the Internet field, can solve the problems of unreasonable arrangement of word combinations and insufficient interest, and achieve the effect of improving user experience, interest and efficiency.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052] figure 1 A word combination arrangement method provided for the embodiment of this application, the method includes:
[0053] S101. Initialize an N*N matrix.
[0054] S102. Find N words composed of M letters.
[0055] S103. Fill the found N words into an N*N matrix according to a preset filling method.
[0056] S104, sequentially combining the N words to determine the target word.
[0057] In the method provided in the embodiment of the present application, by initializing an N*N matrix, searching for N words composed of M letters, filling the found N words into the N*N matrix according to the preset filling method, and sequentially filling the Combining N words to determine the target word can realize effective word hints and quickly determine the target word.
[0058] Further, this method is applied in the game of guessing words using letters, which can provide effective word prompts to users playing the game, so that users can quickly guess the correct word, ther...
Embodiment 2
[0060] figure 2 A word combination arrangement method provided for the embodiment of this application, the method includes:
[0061] S201. Initialize an N*N matrix.
[0062] S202. Find N words composed of M letters.
[0063] S203. Obtain word length information of N words.
[0064] In the embodiment of the present application, step S203, obtaining the word length information of the N words includes: sorting the N words according to the word length information.
[0065] S204. Fill the longest word into the N*N matrix.
[0066] In the embodiment of the present application, step S204, filling the longest word into the N*N matrix includes:
[0067] Select a row in the N*N matrix as the target row;
[0068] Fill the longest word into the target line.
[0069] In the embodiment of the present application, step S204, filling the longest word into the N*N matrix includes:
[0070] Select a column in the N*N matrix as the target column;
[0071] Fill the longest word into the ta...
Embodiment 3
[0076] image 3 A word combination arrangement method provided for the embodiment of this application, the method includes:
[0077] S301. Initialize an N*N matrix.
[0078] S302. Find N words composed of M letters.
[0079] S303. Randomly select K words from the found N words as candidate words.
[0080] S304. Fill the found N words and the selected K candidate words into an N*N matrix according to a preset filling method.
[0081] In the embodiment of the present application, in step S304, the selected K candidate words are filled into the N*N matrix according to the preset filling method, including:
[0082] Get the word length information of K candidate words;
[0083] Fill the longest candidate word into the N*N matrix;
[0084] The second-longest candidate word is spliced with the longest candidate word, and the second-longest candidate word and the longest candidate word are not connected end to end;
[0085] Repeat the above steps: fill the longest candidate wo...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com