Update exam/packet.tex
This commit is contained in:
@@ -145,10 +145,10 @@ Output:
|
|||||||
\problem{Problem 3: Merge Intervals}
|
\problem{Problem 3: Merge Intervals}
|
||||||
\textit{Difficulty: Hard}
|
\textit{Difficulty: Hard}
|
||||||
|
|
||||||
You are given a string S composed of only the characters ‘6’, ‘7’, 'A’, 'B’, and ‘#’ (without the quotation marks). This string is processed from left to right, and you must maintain a sequence of chracters that changes according to these rules:
|
You are given a string S composed of only the characters \‘6\’, \‘7\’, \'A\’, \'B\’, and \‘#\’ (without the quotation marks). This string is processed from left to right, and you must maintain a sequence of chracters that changes according to these rules:
|
||||||
1. The sequence starts out empty.
|
1. The sequence starts out empty.
|
||||||
2. 6 - add a 6 to the end of the sequences
|
2. 6 - add a 6 to the end of the sequences
|
||||||
3. 7 - if the sequence is non-empty and its last chracter is ‘6’, remove that last ‘6’, otherwise, add ‘7’ to the end of the sequence
|
3. 7 - if the sequence is non-empty and its last chracter is \‘6\’, remove that last \‘6\’, otherwise, add \‘7\’ to the end of the sequence
|
||||||
4. A - reverse the sequence
|
4. A - reverse the sequence
|
||||||
5. B - add a duplicate of the current sequence to the end of it
|
5. B - add a duplicate of the current sequence to the end of it
|
||||||
6. # - clear the sequence
|
6. # - clear the sequence
|
||||||
|
|||||||
Reference in New Issue
Block a user