Word slips: Positive proof strip
Inputs
line is text. A character is one letter, digit, space, or punctuation mark.
Your tasks
- Create a list
wordLengths. Readlinefrom left to right. Here, a word is a group of characters with no spaces inside it. Record the length of each word. Ignore extra spaces before, after, or between words. For "a cat",wordLengthsis [1, 3]. - Create a list
positiveValuesthat keeps only the numbers inwordLengthsthat are greater than 0, in the same order. - Complete
wordSlipsPositiveProofStripso it returnspositiveValues. Return it, do not print it.
Example
If line is "pu kls", then wordLengths is [2, 3] and wordSlipsPositiveProofStrip returns [2, 3].
Rules
- Keep repeated numbers.
- If
wordLengthsis empty, return [].
Test data
TEST DATA 1: line is "giifl qzzza".
TEST DATA 2: line is "II iII".
Examples
Input: line = "giifl qzzza" Output: [5,5]
wordLengths is [5, 5]. Keep only numbers greater than 0, without changing their order. Return [5, 5].
Input: line = "II iII" Output: [2,3]
wordLengths is [2, 3]. Keep only numbers greater than 0, without changing their order. Return [2, 3].
Input: line = "" Output: []
wordLengths is []. Keep only numbers greater than 0, without changing their order. Return [].
Input limits
- 0 <= input size <= 64.
- Answers fit in a signed 32-bit integer: -2,147,483,648 through 2,147,483,647.
- The text uses ASCII characters (a basic character set). Only an ordinary space separates words.
Efficiency goal
Big-O describes how the work or memory needed grows as the input gets larger.
Efficiency goal: time O(n); extra memory, including the helper list, O(n). n is the input length. These labels describe how work and memory grow with the input.
Practice focus
Build wordLengths first, then return exactly what the tasks ask for. Follow the order, keep repeated values when the rule says so, and check the empty case.