sundi133
BAN USERcalcprobablity(int i,int j){
int tot=totalconfinside(i,j)
prob=tot/8(calcprobablity(i-1,j+2)+calcprobablity(i-1,j-2).....)
return prob
}
int totalconfinside(i,j){
int cnt=0;
if(valid(i-1,j+2))
cnt++
if(valid(i-1,j-2))
cnt++
return cnt
}
isvalid(int i,int j){
if(i>0 && i <8 && j>0 && j<8)
return true
else
return false
}
solvedata(int[] arr){
for(int k=0;k<arr.length;k++)
int point=solve(arr,k,arr[k],k)
if(point!=-1){
System.out.println(point);
}
}
}
solve(int[] carr, int i,int j,int start){
if(i<0)
i=carr.length-1
if(i>carr.length-1)
i=i%carr.length;
if(j<0)
return -1
if(j>0 && j%carr.length==start)
return start
int left= solve(arr,i-1,j-dist(i,i-1),k)
int right= solve(arr,i+1,j-dist(i,i+1),k)
if(left!=-1 || right!=-1)
return Math.max(left,right)
}
return -1
}
Call ReverseTTree(root,null).
ReverseTTree(Node node,Node parent){
List list= new List();
int n=node.child.length;
int i=0;
if(n==0){
node.next=parent
node.prev=null;
list.add(node)
return list;
}
while( i<=n){
List li2 = ReverseTTree(node.child[i],node)
for(int j=0;j<li2.size();j++){
Node node1=(Node) li2.get(i);
node1.next=node;
node1.prev=null;
list.add(node1);
}
i++;
}
return list;
}
Please let me know for any bugs...
maintaining a seprate queue and compare the front element with the elements on the the recursion stack.
- sundi133 March 03, 2012