一种平衡的0-1矩阵 [英] A type of balanced 0–1 matrix

问题描述

嗨...我想用Java编写一个程序，该程序可以计算N * N平衡矩阵的数量...我知道的唯一方法是考虑矩阵的所有可能配准，然后选择答案...我搜索了该主题，并在Wikipedia中找到了有关该主题的内容...它通过动态编程解决了问题，但不幸的是，我不完全了解算法...任何人都可以帮忙，并为我提供完整的示例解释，该怎么做?做什么?
这是我找到的链接:
http://en.wikipedia.org/wiki/Dynamic_programming#A_type_of_balanced_0.E2.80.931_matrix [ ^ ]

Hi...I wanna write a program in java that can count the number of balanced matrix of N*N...the only way that I know is to consider all the possible assginments for the matrix and then choose the answers...I searched the topic and found something about it in wikipedia...it solved the problem with dynamic programming but unfortunately I don''t understand exactly the algorithm...can anyone help and explain completely with example for me what to do ?
this is the link that I found :
http://en.wikipedia.org/wiki/Dynamic_programming#A_type_of_balanced_0.E2.80.931_matrix[^]

推荐答案

它使用递归方法.

2篇文章/与此相关的教程:
http://www.hostitwise.com/java/java_recursion.html [ http://www.javaworld.com/javaworld/javatips/jw-javatip62.html [ ^ ]

It''s using recursive methods.

2 articles / tutorials to this:
http://www.hostitwise.com/java/java_recursion.html[^]

http://www.javaworld.com/javaworld/javatips/jw-javatip62.html[^]

这篇关于一种平衡的0-1矩阵的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！