No self-introduction
Loading
Profile
Follow
codes (1)
Car scheduling source code
no vote
Assume that the number of the car series at the entrance of the railway dispatching station is 1, 2, 3 n。 Design a program to find out all the possible output length of N car series. First, the first must be 1, because you can't get out of the stack at the beginning. Second, the last bit cannot be 1, that is, it cannot be put on the stack last. Thirdly, the numbers of 0 and 1 should be matched. Here, there are three 0 and 1, and the fourth and 0 can't be more than 1. Let's use 4 as an example, 11000110. In this case, the above three conditions are met, but this is wrong
wuxiandingwei 0 0
1
No more~
Follows0
Fans0