LeetCode Çözümleri – 434. Number of Segments in a String

LeetCode içerisinde bulunan “Number of Segments in a String” sorusunun açıklaması ve çözümü. Bu soruda size verilen string içerisinde, “segment” yani boşluk karakteri içermeyen karakterler bütünü sayısını bulmanız isteniyor.

🔥 LeetCode 434. Number of Segments in a String: https://leetcode.com/problems/number-of-segments-in-a-string/

➡️ Problem açıklaması:

You are given a string s, return the number of segments in the string.

A segment is defined to be a contiguous sequence of non-space characters.

Example 1:

Input: s = “Hello, my name is John”

Output: 5

Explanation: The five segments are [“Hello,”, “my”, “name”, “is”, “John”]

Example 2:

Input: s = “Hello”

Output: 1

Example 3:

Input: s = “love live! mu’sic forever”

Output: 4

Example 4:

Input: s = “”

Output: 0


0 <= s.length <= 300

s consists of lower-case and upper-case English letters, digits or one of the following characters “!@#$%^&*()_+-=’,.:”.

The only space character in s is ‘ ‘.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.