문제
A sentence is a list of words that are separated by a single space with no leading or trailing spaces.
For example, "Hello World", "HELLO", "hello world hello world" are all sentences.
Words consist of only uppercase and lowercase English letters. Uppercase and lowercase English letters are considered different.
A sentence is circular if:
The last character of a word is equal to the first character of the next word.
The last character of the last word is equal to the first character of the first word.
For example, "leetcode exercises sound delightful", "eetcode", "leetcode eats soul" are all circular sentences. However, "Leetcode is cool", "happy Leetcode", "Leetcode" and "I like Leetcode" are not circular sentences.
Given a string sentence, return true if it is circular. Otherwise, return false.
요약
문장을 주는데 각 단어에서 마지막 char 과 다음 단어의 처음 char이 같은지 확인하면된다.
풀이
걍 확인하면된다
코드
class Solution {
public boolean isCircularSentence(String sentence) {
String[] words = sentence.split(" ");
for (int i = 0; i < words.length - 1; i ++) {
String word = words[i];
if (word.charAt(word.length() - 1) != words[i+1].charAt(0)) {
return false;
}
}
String last = words[words.length - 1];
return words[0].charAt(0) == last.charAt(last.length() - 1);
}
}
풀이 시간
3분? 2분?
체감 난이도
easy
'알고리즘' 카테고리의 다른 글
2024 11 04 3163. String Compression III (1) | 2024.11.04 |
---|---|
2024 11 03 Result796. Rotate String (1) | 2024.11.03 |
2024 11 04 1957. Delete Characters to Make Fancy String (2) | 2024.11.01 |
2024 10 30 1671. Minimum Number of Removals to Make Mountain Array (0) | 2024.10.30 |
2024 10 29 2684. Maximum Number of Moves in a Grid (0) | 2024.10.29 |