Commit 9869afc

committed

Tests for 647. Palindromic Substrings

1 parent a58f140 commit 9869afcCopy full SHA for 9869afc

File tree

+32

-1

lines changed

+32

-1

lines changed

Lines changed: 4 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -17,14 +17,17 @@ class Solution {`
`17`	`17`	`int countPalindromes(String s, int left, int right) {`
`18`	`18`	`int count = 0;`
`19`	`19`	`while (left >= 0 && right < s.length && s[left] == s[right]) {`
	`20`	`+ // print(s.substring(left, right + 1));`
	`21`	`+`
`20`	`22`	`count++;`
`21`	`23`	`left--;`
`22`	`24`	`right++;`
`23`	`25`	`}`
	`26`	`+`
`24`	`27`	`return count;`
`25`	`28`	`}`
`26`	`29`	`}`
`27`	`30`
`28`	`31`	`void main(List<String> args) {`
`29`		`- print(Solution().countSubstrings('aaa'));`
	`32`	`+ print(Solution().countSubstrings('racecar'));`
`30`	`33`	`}`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -29,6 +29,7 @@ import 'medium/3.longest_substring_without_repeating_characters.test.dart'`
`29`	`29`	`import 'medium/424.longest_repeating_character_replacement.test.dart' as longest_repeating_character_replacement;`
`30`	`30`	`import 'medium/49.group_anagrams.test.dart' as group_anagrams;`
`31`	`31`	`import 'medium/5.longest_palindromic_substring.test.dart' as longest_palindromic_substring;`
	`32`	`+import 'medium/647.palindromic_substrings.test.dart' as palindromic_substrings;`
`32`	`33`	`import 'medium/912.sort_an_array.test.dart' as sort_an_array;`
`33`	`34`
`34`	`35`	`void main() {`
`@@ -60,5 +61,6 @@ void main() {`
`60`	`61`	`valid_anagram.main();`
`61`	`62`	`group_anagrams.main();`
`62`	`63`	`longest_palindromic_substring.main();`
	`64`	`+ palindromic_substrings.main();`
`63`	`65`	`});`
`64`	`66`	`}`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+import 'package:leetcode/src/medium/647.palindromic_substrings/main.dart';`
	`2`	`+import 'package:test/test.dart';`
	`3`	`+`
	`4`	`+void main() {`
	`5`	`+ group('sort_an_array', () {`
	`6`	`+ final f = Solution().countSubstrings;`
	`7`	`+`
	`8`	`+ test('returns 0 for empty input', () {`
	`9`	`+ expect(f(''), equals(0));`
	`10`	`+ });`
	`11`	`+`
	`12`	`+ test('returns correct count for single-character input', () {`
	`13`	`+ expect(f('a'), equals(1));`
	`14`	`+ });`
	`15`	`+`
	`16`	`+ test('returns correct count for input with single-character palindromic substrings', () {`
	`17`	`+ expect(f('abc'), equals(3));`
	`18`	`+ });`
	`19`	`+`
	`20`	`+ test('returns correct count for input with palindromes', () {`
	`21`	`+ expect(f('aba'), equals(4));`
	`22`	`+ expect(f('abba'), equals(6));`
	`23`	`+ expect(f('racecar'), equals(10));`
	`24`	`+ });`
	`25`	`+ }); // group 'sort_an_array'`
	`26`	`+}`

Comments

(0)