Commit fc73fe6

committed

solves #2490: Circular Sentence in java

1 parent 1534755 commit fc73fe6Copy full SHA for fc73fe6

File tree

+16

-1

lines changed

+16

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -784,7 +784,7 @@`
`784`	`784`	`\| 2475 \| [Number of Unequal Triplets in Array](https://leetcode.com/problems/number-of-unequal-triplets-in-array) \| [![Java](assets/java.png)](src/NumberOfUnequalTripletsInArray.java) \| \|`
`785`	`785`	`\| 2481 \| [Minimum Cuts to Divide a Circle](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle) \| [![Java](assets/java.png)](src/MinimumCutsToDivideACircle.java) \| \|`
`786`	`786`	`\| 2485 \| [Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer) \| [![Java](assets/java.png)](src/FindThePivotInteger.java) \| \|`
`787`		`-\| 2490 \| [Circular Sentence](https://leetcode.com/problems/circular-sentence) \| \| \|`
	`787`	`+\| 2490 \| [Circular Sentence](https://leetcode.com/problems/circular-sentence) \| [![Java](assets/java.png)](src/CircularSentence.java) \| \|`
`788`	`788`	`\| 2492 \| [Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities) \| [![Python](assets/python.png)](python/minimum_score_of_a_path_between_two_cities.py) \| \|`
`789`	`789`	`\| 2496 \| [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array) \| \| \|`
`790`	`790`	`\| 2500 \| [Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row) \| \| \|`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+// https://leetcode.com/problems/circular-sentence`
	`2`	`+// T: O(N)`
	`3`	`+// S: O(1)`
	`4`	`+`
	`5`	`+public class CircularSentence {`
	`6`	`+ public boolean isCircularSentence(String sentence) {`
	`7`	`+ for (int index = 0 ; index < sentence.length() ; index++) {`
	`8`	`+ char letter = sentence.charAt(index);`
	`9`	`+ if (letter == ' ' && sentence.charAt(index - 1) != sentence.charAt(index + 1)) {`
	`10`	`+ return false;`
	`11`	`+ }`
	`12`	`+ }`
	`13`	`+ return sentence.charAt(0) == sentence.charAt(sentence.length() - 1);`
	`14`	`+ }`
	`15`	`+}`

Comments

(0)