Question

目前摆弄着我正在研究的一个小项目，这是一个倒计时型游戏（电视节目）。目前，该程序允许用户选择9个字母的元音或辅音，然后要求他们使用这9个字母输入他们能想到的最长的单词。

我有一个大型文本文件充当字典，我使用用户输入的字符串搜索以尝试匹配结果以检查他们输入的单词是否是有效单词。我的问题是，我想在我的字典中搜索由九个字母组成的最长单词，但我似乎无法找到实现它的方法。

到目前为止，我已经尝试将每个单词放入一个数组中并搜索每个元素以检查它是否包含字母，但是如果9个字母中最长的单词是8个字母单词，则不会覆盖我。有任何想法吗？目前我有这个（这是在表单上的提交按钮下，抱歉没有提供代码或提到它是一个Windows窗体应用程序）：

StreamReader textFile = new StreamReader("C:/Eclipse/Personal Projects/Local_Projects/Projects/CountDown/WindowsFormsApplication1/wordlist.txt");
int counter1 = 0;
String letterlist = (txtLetter1.Text + txtLetter2.Text + txtLetter3.Text + txtLetter4.Text + txtLetter5.Text + txtLetter6.Text + txtLetter7.Text + txtLetter8.Text + txtLetter9.Text); // stores the letters into a string
char[] letters = letterlist.ToCharArray(); // reads the letters into a char array
string[] line = File.ReadAllLines("C:/Eclipse/Personal Projects/Local_Projects/Projects/CountDown/WindowsFormsApplication1/wordlist.txt"); // reads every line in the word file into a string array (there is a new word on everyline, and theres 144k words, i assume this will be a big performance hit but i've never done anything like this before so im not sure ?)

line.Any(x => line.Contains(x)); // just playing with linq, i've no idea what im doing though as i've never used before
for (int i = 0; i < line.Length; i++)// a loop that loops for every word in the  string array
//  if (line.Contains(letters)) //checks if a word contains the letters in the char array(this is where it gets hazy if i went this way, i'd planned on only using words witha  letter length > 4, adding any words found to another text file and either finding the longest word then in this text file or keeping a running longest word i.e.  while looping i find a word with 7 letters, this is now the longest word, i then go to the next word and it has 8 of our letters, i now set the longest word to this)

counter1++;
if (counter1 > 4)

txtLongest.Text + = line + Environment.NewLine;

迈克的代码：

using System;

使用System.Collections.Generic; 使用System.Linq;

课程计划

static void Main(string[] args) {
    var letters = args[0];

    var wordList = new List<string> { "abcbca", "bca", "def" }; // dictionary

    var results = from string word in wordList // makes every word in dictionary into a seperate string
                  where IsValidAnswer(word, letters) // calls isvalid method
                  orderby word.Length descending // sorts the word with most letters to top
                  select word; // selects that word

    foreach (var result in results) {
        Console.WriteLine(result);    //  outputs the word
    }
}

private static bool IsValidAnswer(string word, string letters) {
    foreach (var letter in word) {
        if (letters.IndexOf(letter) == -1) { // checks if theres letters in the word
            return false;
        }

        letters = letters.Remove(letters.IndexOf(letter), 1);
    }

    return true;
}

}

Answer 1

这是一个答案，我在几分钟内敲了一下，应该做你想要的。正如其他人所说，这个问题很复杂，所以算法会很慢。 LINQ查询计算字典中的每个字符串，检查提供的字母是否可用于生成所述字。

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static void Main(string[] args) {
        var letters = args[0];

        var wordList = new List<string> { "abcbca", "bca", "def" };

        var results = from string word in wordList
                      where IsValidAnswer(word, letters)
                      orderby word.Length descending
                      select word;

        foreach (var result in results) {
            Console.WriteLine(result);    
        }
    }

    private static bool IsValidAnswer(string word, string letters) {
        foreach (var letter in word) {
            if (letters.IndexOf(letter) == -1) {
                return false;
            }

            letters = letters.Remove(letters.IndexOf(letter), 1);
        }

        return true;
    }
}

Answer 2

那么你被困在哪里？从慢速暴力方法开始，只需找到包含所有字符的所有单词。然后按长度排序以获得最长的单词。如果你不想返回一个短于所寻找的字符数的单词（我想这只是一个问题，如果有重复的字符???），那么添加一个测试并消除这种情况。

Answer 3

我对此有了更多的想法。我认为有效地做到这一点的方法是预处理字典，按字母顺序排列每个单词中的字母，并按字母顺序排列列表中的单词（你可能不得不使用某种多图结构来存储原始单词）和排序的单词）。

完成后，您可以更有效地找到可以从您的信函池中生成的单词。如果其他人没有打败我，我会回来并充实一个算法来做这件事。

Answer 4

步骤1：构建一个trie结构，每个单词都按字母排序。

示例：EACH被分类到ACEH被存储为A-＆gt; C-＆gt; E-＆gt; H-＆gt;（EACH，ACHE，...）在trie中（ACHE是EACH的字谜）。< / p>

步骤2：对输入字母进行排序，找到对应于该字母中该字母组的最长单词。

Answer 5

您是否尝试过这样的实现？很高兴看到你尝试过的代码。

string[] strArray = {"ABCDEFG", "HIJKLMNOP"};
string findThisString = "JKL";
int strNumber;
int strIndex = 0;
for (strNumber = 0; strNumber < strArray.Length; strNumber++)
{
    strIndex = strArray[strNumber].IndexOf(findThisString);
    if (strIndex >= 0)
        break;
}
System.Console.WriteLine("String number: {0}\nString index: {1}",
    strNumber, strIndex);

Answer 6

这必须完成这项工作：

private static void Main()
{
    char[] picked_char = {'r', 'a', 'j'};
    string[] dictionary = new[] {"rajan", "rajm", "rajnujaman", "rahim", "ranjan"};
    var words = dictionary.Where(word => picked_char.All(word.Contains)).OrderByDescending(word => word.Length);


    foreach (string needed_words in words)
    {
        Console.WriteLine(needed_words);
    }
}

输出：

rajnujaman
ranjan
rajan
rajm

搜索字符串数组是否包含char的数组

6 个答案: