當前位置: 首頁>>代碼示例>>C#>>正文


C# BinaryTree.PopMax方法代碼示例

本文整理匯總了C#中BinaryTree.PopMax方法的典型用法代碼示例。如果您正苦於以下問題:C# BinaryTree.PopMax方法的具體用法?C# BinaryTree.PopMax怎麽用?C# BinaryTree.PopMax使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在BinaryTree的用法示例。


在下文中一共展示了BinaryTree.PopMax方法的1個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的C#代碼示例。

示例1: Solve

        private int Solve()
        {
            Square current = new Square(new int[] {0, 0}, 1, 0);
            BinaryTree<Square> store = new BinaryTree<Square>();
            store.Add(current);

            double targetSize = 0;

            while(!store.Empty()) {
                current = store.PopMax();

                int[] curentCoordinates = current.GetCoordinates();
                if(curentCoordinates[0] == coordinates[0] && curentCoordinates[1] == coordinates[1]) {
                    targetSize = current.GetSize();
                }

                Square[] children = current.GetChildren();
                foreach (Square child in children) {
                    int[] childCoordinates = child.GetCoordinates();
                    if(childCoordinates[0] <= coordinates[0] && childCoordinates[1] <= coordinates[1]) {
                        store.Add(child);
                    }
                }
            }

            int count = 0;
            int result = -1;

            current = new Square(new int[] { 0, 0 }, 1, 0);
            store.Add(current);

            while (!store.Empty()) {
                count++;
                current = store.PopMax();

                int[] curentCoordinates = current.GetCoordinates();
                if (curentCoordinates[0] == coordinates[0] && curentCoordinates[1] == coordinates[1]) {
                    result = count;
                }

                Square[] children = current.GetChildren();
                for (int i = 0; i < children.Length; i++) {
                    if (targetSize <= children[i].GetSize()) {
                        store.Add(children[i]);
                    }
                }
            }

            return result;
        }
開發者ID:ThRM,項目名稱:BackOnTheWeb,代碼行數:50,代碼來源:Program.cs


注:本文中的BinaryTree.PopMax方法示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。