CareerCup View from the left and the right
2014-03-05 09:48
597 查看
You are given N blocks of height 1…N. In how many ways can you arrange these blocks in a row such that when viewed from left you
see only L blocks (rest are hidden by taller blocks) and when seen from right you see only R blocks? Example given N=3, L=2, R=1 there is only one arrangement {2, 1, 3} while for N=3, L=2, R=2 there are two ways {1, 3, 2} and {2, 3, 1}.
------------------------------------------------------
consider moving 1 in different position.
When we put 1 at position 2, 3, ... n-1, it has no contribution to both view. When it is put at position 1, it add 1 to the left view and when it is put at n, it adds 1 to right view. Hence We have
F(n, L, R) = (n - 2)*F(n-1, L, R) + F(n-1, L-1, R) + F(n-1, L, R - 1)
see only L blocks (rest are hidden by taller blocks) and when seen from right you see only R blocks? Example given N=3, L=2, R=1 there is only one arrangement {2, 1, 3} while for N=3, L=2, R=2 there are two ways {1, 3, 2} and {2, 3, 1}.
------------------------------------------------------
consider moving 1 in different position.
When we put 1 at position 2, 3, ... n-1, it has no contribution to both view. When it is put at position 1, it add 1 to the left view and when it is put at n, it adds 1 to right view. Hence We have
F(n, L, R) = (n - 2)*F(n-1, L, R) + F(n-1, L-1, R) + F(n-1, L, R - 1)
相关文章推荐
- matlab 标定箱错误:Disabling view 2 - Reason: the left and right images are found inconsistent (已解决)
- travel the binary tree by level 3 ( from down to top and from right to left every level )
- travel the binary tree by level 5 ( from down to top and from left to right every level )
- travel the binary tree by level 4 ( from down to top and from left to right every level )
- we sign the 3 page from left to right with -1,0,1
- Change the marquee directions on button click left and right
- CareerCup What is the difference between a computers heap and it's stack?
- CareerCup Find top k values (asec) which can either be the number from the array A
- CareerCup Find the smallest range that includes at least one number from each of the k sorted lists.
- CareerCup Find all the conflicting appointments from a given list of n appointments.
- CareerCup Find out the winning probability given n, m and x
- the item width must be less than the width of the UICollectionView minus the section insets left and
- 119.View the Exhibit and examine the output of the query. What do you infer from this?
- 5大方法完美解决View的移动:layout(),offsetLeftAndRight(),MarginLayoutParams,动画,scrollTo
- 递归交换二叉树左右子树:BinaryTree:Exchange the left child and right child of a binary tree
- 自定义View:左右两边显示 text 的 TextView(RightAndLeftTextView)
- presentModalViewController animation from left to right
- IOS如何给VIEW设置2个圆角?set cornerRadius for only top-left and top-right corner of a UIVIEW
- the Differences of Fold-left and Fold-right
- 非递归交换二叉树左右子树:BinaryTree:Exchange the left child and the right child without recursive method