Question

我正在尝试为Windows Phone创建自己的WordSearch游戏，我找到了解决它的算法。我的问题是该算法使用递归，我在6-8次调用后得到一个StackOverflowException。

array：char [，]包含2D表格的字符
i，a：数组中当前位置的坐标
宽度，高度：数组的大小
build：我们正在尝试创建的字符串（单词本身）
cover：bool [，]用于已经使用的字符

以下是算法：

...
enum WordType : byte
    {
        FullWord,
        PartialWord,
        FullWordAndPartialWord
    }  
...
static Dictionary<string, WordType> _words = new Dictionary<string, WordType>();
static Dictionary<string, bool> _found = new Dictionary<string, bool>();

void Search(char[,] array, int i, int a, int width, int height, string build, bool[,] covered)
        {            
            if (i >= width || i < 0 || a >= height || a < 0)
            {
                return;
            }            
            if (covered[a, i])
            {
                return;
            }

            char letter = array[a, i];

            string pass = build + letter;            
            WordType value;
            if (_words.TryGetValue(pass, out value))
            {                
                if (value == WordType.FullWord ||
                value == WordType.FullWordAndPartialWord)
                {                    
                    if (!_found.ContainsKey(pass))
                    {                        
                        _found.Add(pass, true);
                    }
                }

                if (value == WordType.PartialWord ||
                value == WordType.FullWordAndPartialWord)
                {

                    bool[,] cov = new bool[height, width];
                    for (int i2 = 0; i2 < width; i2++)
                    {
                        for (int a2 = 0; a2 < height; a2++)
                        {
                            cov[a2, i2] = covered[a2, i2];
                        }
                    }

                    cov[a, i] = true;

                    Search(array, i + 1, a, width, height, pass, cov);
                    Search(array, i, a + 1, width, height, pass, cov);
                    Search(array, i + 1, a + 1, width, height, pass, cov);
                    Search(array, i - 1, a, width, height, pass, cov);
                    Search(array, i, a - 1, width, height, pass, cov);
                    Search(array, i - 1, a - 1, width, height, pass, cov);
                    Search(array, i - 1, a + 1, width, height, pass, cov);
                    Search(array, i + 1, a - 1, width, height, pass, cov);
                }
            }
        }

当我打电话时：

 for (int i = 0; i < width; i++)
            {
                for (int a = 0; a < height; a++)
                {
                    Search(array, i, a, width, height, "", covered);
                }
            }

我可以做些什么来避免异常？

如何编写这种递归算法以减少内存消耗？

0 个答案: