Merge pull request #38 from fartem/tests-1

2025-05-08 v. 1.0.9: refactored tests

Author: fartem

pubspec.yaml

@@ -1,6 +1,6 @@
 name: leetcode_dart
 description: Some solved problems from https://leetcode.com on Dart
-version: 1.0.8
+version: 1.0.9
 homepage: https://github.com/fartem/leetcode-dart
 
 environment:

test/easy/100_same_tree_test.dart

@@ -9,7 +9,7 @@ void main() {
       final solution = Solution();
 
       test(
-        'true',
+        'Test case 1',
         () => expect(
           true,
           solution.isSameTree(
@@ -27,7 +27,7 @@ void main() {
         ),
       );
       test(
-        'false',
+        'Test case 2',
         () => expect(
           false,
           solution.isSameTree(
@@ -44,7 +44,7 @@ void main() {
         ),
       );
       test(
-        'false',
+        'Test case 3',
         () => expect(
           false,
           solution.isSameTree(

test/easy/101_symmetric_tree_test.dart

@@ -9,7 +9,7 @@ void main() {
       final solution = Solution();
 
       test(
-        'true',
+        'Test case 1',
         () => expect(
           true,
           solution.isSymmetric(
@@ -30,7 +30,7 @@ void main() {
         ),
       );
       test(
-        'false',
+        'Test case 2',
         () => expect(
           false,
           solution.isSymmetric(

test/easy/104_maximum_depth_of_binary_tree_test.dart

@@ -9,7 +9,7 @@ void main() {
       final solution = Solution();
 
       test(
-        '3',
+        'Test case 1',
         () => expect(
           3,
           solution.maxDepth(
@@ -26,7 +26,7 @@ void main() {
         ),
       );
       test(
-        '2',
+        'Test case 2',
         () => expect(
           2,
           solution.maxDepth(

test/easy/108_convert_sorted_array_to_binary_search_tree_test.dart

@@ -11,7 +11,7 @@ void main() {
       final solution = Solution();
 
       test(
-        '[0, -10, 5, null, -3, null, 9]',
+        'Test case 1',
         () => expect(
           true,
           BinaryTreeHelper.areEqual(
@@ -35,7 +35,7 @@ void main() {
         ),
       );
       test(
-        '3, null, 1',
+        'Test case 2',
         () => expect(
           true,
           BinaryTreeHelper.areEqual(

test/easy/110_balanced_binary_tree_test.dart

@@ -9,7 +9,7 @@ void main() {
       final solution = Solution();
 
       test(
-        'true',
+        'Test case 1',
         () => expect(
           true,
           solution.isBalanced(
@@ -26,7 +26,7 @@ void main() {
         ),
       );
       test(
-        'false',
+        'Test case 2',
         () => expect(
           false,
           solution.isBalanced(

test/easy/111_minimum_depth_of_binary_tree_test.dart

@@ -9,7 +9,7 @@ void main() {
       final solution = Solution();
 
       test(
-        '2',
+        'Test case 1',
         () => expect(
           2,
           solution.minDepth(
@@ -26,7 +26,7 @@ void main() {
         ),
       );
       test(
-        '5',
+        'Test case 2',
         () => expect(
           5,
           solution.minDepth(

test/easy/112_path_sum_test.dart

@@ -9,7 +9,7 @@ void main() {
       final solution = Solution();
 
       test(
-        'true',
+        'Test case 1',
         () => expect(
           true,
           solution.hasPathSum(
@@ -41,7 +41,7 @@ void main() {
         ),
       );
       test(
-        'false',
+        'Test case 2',
         () => expect(
           false,
           solution.hasPathSum(
@@ -55,7 +55,7 @@ void main() {
         ),
       );
       test(
-        'false',
+        'Test case 3',
         () => expect(
           false,
           solution.hasPathSum(

test/easy/118_pascals_triangle_test.dart

@@ -8,7 +8,7 @@ void main() {
       final solution = Solution();
 
       test(
-        '[[1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1]]',
+        'Test case 1',
         () => expect(
           [
             [1],
@@ -21,7 +21,7 @@ void main() {
         ),
       );
       test(
-        '[1]',
+        'Test case 2',
         () => expect(
           [
             [1],

test/easy/13_roman_to_integer_test.dart

@@ -8,21 +8,21 @@ void main() {
       final solution = Solution();
 
       test(
-        '3',
+        'Test case 1',
         () => expect(
           3,
           solution.romanToInt('III'),
         ),
       );
       test(
-        '58',
+        'Test case 2',
         () => expect(
           58,
           solution.romanToInt('LVIII'),
         ),
       );
       test(
-        '1994',
+        'Test case 3',
         () => expect(
           1994,
           solution.romanToInt('MCMXCIV'),