Word slips: Floor ticket
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]. - Find the smallest number in
wordLengths. Store it insmallest. - Complete
wordSlipsFloorTicketso it returnssmallest. Return it, do not print it.
Example
If line is "ug mwf", then wordLengths is [2, 3] and wordSlipsFloorTicket returns 2.
Rules
- If
wordLengthsis empty, return 0.
Test data
TEST DATA 1: line is "srrld cddde".
TEST DATA 2: line is "RR rRR".
Examples
Input: line = "srrld cddde" Output: 5
wordLengths is [5, 5]. The smallest number is 5. Return 5.
Input: line = "RR rRR" Output: 2
wordLengths is [2, 3]. The smallest number is 2. Return 2.
Input: line = "" Output: 0
wordLengths is []. The list is empty, so return 0.
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.