CareerCup

You should see linked list implementation in the linux kernel. This question seems to be parallel to how does iteration over list list_for_each() is implemented.

CalculateList(A){
count = 0 ;
For each Object o in A{
if( o is type of List){
count = count + CalculateList(o);
}
return count = count +1;
}

Alternatively the problem can be viewed as, find length of list. And everyone knows how to find that.

can you explain in more detail your Question

Total Number of list present when top level list reference say PARENTLIST is given.

# <include iostream.h>
do
{
cin>>num;
//proess num here...
while(num!=0);
}

struct LIST {
int data;
LIST * child;
};
int findNumOfList(LIST *l) {
if (l->child == null)
return 0;
return findNumOfList(l->child) + 1;
}

public int getListsCount(List list){
int count = 0;
for (int i=0; i <list.size(); i++ ){
if (list.get(i) instanceof Object){
count = count + 1 + getListsCount((List)list.get(i));
}
}
return count;
}

}

public class ParentList {
List myPrivateList= new ArrayList();
public int getNumberOfList(List list)
{

for(Object i: list)
{
if(i instanceof List)
{
count++;
getNumberOfList((List)i);
}
}
return count+1;//for the main list
}

}

A recursive function can be used to traverse through the ParentList and its children and their children and so on...

public static int findListCount(SpecialList parrent) {
int count = 0;

if (parrent.L == null) {
return 0;
} else {
count = count + findListCount(parrent.L);
count++;
}
return count;
}

/*A List PARENTLIST which contains primitive type and List L, this List L further can have primitve type and List L and so on.
	 *  Given a Root node calculate how many List it have
	 * */
	public static int listCount(List l){
		int count = 0;
		for (Object object : l) {
			count++;
			if(object instanceof List)
				listCount((List)object);
		}	
		return count;
	}