Welcome![Sign In][Sign Up]
Location:
Search - maxtree

Search list

[Other resourcemcolor+maxtree

Description: 这个代码包括求图的最大生成树和M着色问题.-this code includes plans for the biggest tree and M coloring problem.
Platform: | Size: 3689 | Author: micang | Hits:

[Data structsmcolor+maxtree

Description: 这个代码包括求图的最大生成树和M着色问题.-this code includes plans for the biggest tree and M coloring problem.
Platform: | Size: 3072 | Author: | Hits:

[JSP/Javajava_code

Description: 构造数组的最大MaxTree 时间复杂度O(N) 额外空间复杂度O(N)(* establish the tree with the following principles: * 1. the father of each number is the first larger number on its left and the smaller one on its right, the first one larger than it * 2. if a number is infinite on the left, it's not on the right. That is to say, this number is the maximum in the entire number * * / How / / as soon as possible to find out each one on both sides of the first larger number? Using stack Find / left, from left to right through each number, keep the descending order of the stack, the new data kept by the pop from the top of the stack, the stack until the new number or number ratio Find / right, from right to left traverse each number, keep the descending order of the stack, the new data kept by the pop from the top of the stack, the stack until the new number or number ratio)
Platform: | Size: 1024 | Author: 苏沫儿 | Hits:

CodeBus www.codebus.net