public class Solution extends Object
2047 - Number of Valid Words in a Sentence.
Easy
A sentence consists of lowercase letters ('a' to 'z'), digits ('0' to '9'), hyphens ('-'), punctuation marks ('!', '.', and ','), and spaces (' ') only. Each sentence can be broken down into one or more tokens separated by one or more spaces ' '.
A token is a valid word if all three of the following are true:
'-'. If present, it must be surrounded by lowercase characters ("a-b" is valid, but "-ab" and "ab-" are not valid)."ab,", "cd!", and "." are valid, but "a!b" and "c.," are not valid).Examples of valid words include "a-b.", "afad", "ba-c", "a!", and "!".
Given a string sentence, return the number of valid words in sentence.
Example 1:
Input: sentence = “cat and dog”
Output: 3
Explanation: The valid words in the sentence are “cat”, “and”, and “dog”.
Example 2:
Input: sentence = “!this 1-s b8d!”
Output: 0
Explanation: There are no valid words in the sentence.
“!this” is invalid because it starts with a punctuation mark.
“1-s” and “b8d” are invalid because they contain digits.
Example 3:
Input: sentence = “alice and bob are playing stone-game10”
Output: 5
Explanation: The valid words in the sentence are “alice”, “and”, “bob”, “are”, and “playing”. “stone-game10” is invalid because it contains digits.
Constraints:
1 <= sentence.length <= 1000sentence only contains lowercase English letters, digits, ' ', '-', '!', '.', and ','.1 token.| Constructor and Description |
|---|
Solution() |
public int countValidWords(String sentence)
Copyright © 2022. All rights reserved.