Super easy recursive code


#1

Solution::uniquePaths(int A, int B) {
if(A==1 || B==1 )
return 1;
else if(A==0 || B==0)
return 0;

else
return uniquePaths(A-1,B)+uniquePaths(A,B-1);

}