PAT:1004. Counting Leaves (30)
2016-10-30 17:05
537 查看
class Tree
{
private int numOfNodes;
private int numOfNonleaf;
private Map<int,ArrayList<int>> map = new HashMap<int,ArrayList<int>>();
public Tree(int numOfNodes,int numOfNonleaf,Map<int,ArrayList<int>> map){
this.numOfNodes=numOfNodes;
this.numOfNonleaf=numOfNonleaf;
this.map=map;
}
}
class CountLeaves
{
private Map<int,ArrayList<int>> map = new HashMap<int,ArrayList<int>>();
private Map<int,int>column=new HashMap<int,int>();
private int []print=new int[column.size()];
public void readFile(String fileName){
}
Boolean isLeaf(int key){
if(map.containsKey(key)){
return false;
}
else{
return true;
}
}
void setColumn(){
column.put(1,1);
for(int i=0;i<tree.nonleaf;i++){
for(int j=2;j<tree.map.get(i).length;j++){
column.put(tree.map.get(i).get(j),2);
}
}
}
public void select(Tree tree){
ArrayList<int>nextLine=new ArrayList<int>();
if(isLeaf(tree.map.get(0))){
System.out.print("1 ");
}
else{
System.out.print("0 ");
}
int tmp=0;
for(int i=0;i<tree.nonleaf;i++){
for(int j=2;j<tree.map.get(i).length;j++){
if(isLeaf(tree.map.get(i).get(j))){
tmp= column.get(tree.map.get(i).get(j));
print[tmp]++;
}
}
}
}
public void print(){
for(int i=0;i<print.length;i++){
System.out.print(print[i]+" ");
}
}
public static void main(){
CountLeaves leaves=new CountLeaves();
leaves.readFile("D:\\test.txt");
leaves.
}
}
{
private int numOfNodes;
private int numOfNonleaf;
private Map<int,ArrayList<int>> map = new HashMap<int,ArrayList<int>>();
public Tree(int numOfNodes,int numOfNonleaf,Map<int,ArrayList<int>> map){
this.numOfNodes=numOfNodes;
this.numOfNonleaf=numOfNonleaf;
this.map=map;
}
}
class CountLeaves
{
private Map<int,ArrayList<int>> map = new HashMap<int,ArrayList<int>>();
private Map<int,int>column=new HashMap<int,int>();
private int []print=new int[column.size()];
public void readFile(String fileName){
}
Boolean isLeaf(int key){
if(map.containsKey(key)){
return false;
}
else{
return true;
}
}
void setColumn(){
column.put(1,1);
for(int i=0;i<tree.nonleaf;i++){
for(int j=2;j<tree.map.get(i).length;j++){
column.put(tree.map.get(i).get(j),2);
}
}
}
public void select(Tree tree){
ArrayList<int>nextLine=new ArrayList<int>();
if(isLeaf(tree.map.get(0))){
System.out.print("1 ");
}
else{
System.out.print("0 ");
}
int tmp=0;
for(int i=0;i<tree.nonleaf;i++){
for(int j=2;j<tree.map.get(i).length;j++){
if(isLeaf(tree.map.get(i).get(j))){
tmp= column.get(tree.map.get(i).get(j));
print[tmp]++;
}
}
}
}
public void print(){
for(int i=0;i<print.length;i++){
System.out.print(print[i]+" ");
}
}
public static void main(){
CountLeaves leaves=new CountLeaves();
leaves.readFile("D:\\test.txt");
leaves.
}
}
相关文章推荐
- pat甲级1004. Counting Leaves (30)
- PAT:1004. Counting Leaves (30)
- PAT 1004 Counting Leaves (30) Python
- 1004. Counting Leaves (30)(PAT甲)
- PAT(甲级)1004. Counting Leaves (30)
- 1004. Counting Leaves (30)-PAT甲级真题(bfs,dfs,树的遍历,层序遍历)
- (PAT)1004.Counting Leaves (30)
- PAT(Advanced Level)1004. Counting Leaves (30) 树的层次遍历
- PAT:1004. Counting Leaves (30)
- PAT (甲)1004 Counting Leaves (30)(dfs)
- PAT (A )1004. Counting Leaves (30)
- 1004. Counting Leaves (30) PAT甲级
- PAT (Advanced Level) Practise 1004 Counting Leaves (30)
- pat 1004 Counting Leaves (30)
- PAT-Java-1004-Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 关于PAT 1004 Counting leaves 的疑问
- 1004. Counting Leaves (30)
- PAT 1004 Counting Leaves