Question: Consider a binary list B[0..n-1] that includes 0s and1s. Find the length of the longest alternating subsequence 010101...... Example: For the input: [0, 1, 0,
Consider a binary list B[0..n-1] that includes 0s and1s. Find the length of the longest alternating subsequence 010101...... Example: For the input: [0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1]; Output is: 8. Another example: For the input: [0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1]; Output is: 7. Note: Longest alternating subsequences are shown in bold.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
