|
| 1 | +// https://leetcode.com/problems/sort-colors/description/ |
| 2 | +import 'package:test/test.dart'; |
| 3 | + |
| 4 | +void main() { |
| 5 | + final stopwatch = Stopwatch()..start(); |
| 6 | + runTests(); |
| 7 | + |
| 8 | + /// |
| 9 | + stopwatch.stop(); |
| 10 | + print('Function Execution Time : ${stopwatch.elapsedMicroseconds} micro Sec'); |
| 11 | +} |
| 12 | + |
| 13 | +class Solution { |
| 14 | + ////! Accepted From the first time TC: O(N) SC: O(1) |
| 15 | + void sortColors(List<int> nums) { |
| 16 | + int zerosCount = 0; |
| 17 | + int onesCount = 0; |
| 18 | + for (var i = 0; i < nums.length; i++) { |
| 19 | + if (nums[i] == 0) { |
| 20 | + zerosCount++; |
| 21 | + } else if (nums[i] == 1) { |
| 22 | + onesCount++; |
| 23 | + } |
| 24 | + } |
| 25 | + for (var i = 0; i < nums.length; i++) { |
| 26 | + if (zerosCount > 0) { |
| 27 | + nums[i] = 0; |
| 28 | + zerosCount--; |
| 29 | + } else if (onesCount > 0) { |
| 30 | + nums[i] = 1; |
| 31 | + onesCount--; |
| 32 | + } else { |
| 33 | + nums[i] = 2; |
| 34 | + } |
| 35 | + } |
| 36 | + } |
| 37 | +} |
| 38 | + |
| 39 | +void runTests() { |
| 40 | + final Solution s = Solution(); |
| 41 | + |
| 42 | + group('Sort Colors', () { |
| 43 | + // Basic examples from problem statement |
| 44 | + test('Example 1: [2,0,2,1,1,0] → [0,0,1,1,2,2]', () { |
| 45 | + final nums = [2, 0, 2, 1, 1, 0]; |
| 46 | + s.sortColors(nums); |
| 47 | + expect(nums, equals([0, 0, 1, 1, 2, 2])); |
| 48 | + }); |
| 49 | + |
| 50 | + test('Example 2: [2,0,1] → [0,1,2]', () { |
| 51 | + final nums = [2, 0, 1]; |
| 52 | + s.sortColors(nums); |
| 53 | + expect(nums, equals([0, 1, 2])); |
| 54 | + }); |
| 55 | + |
| 56 | + // Edge cases |
| 57 | + test('Single element array: [0] → [0]', () { |
| 58 | + final nums = [0]; |
| 59 | + s.sortColors(nums); |
| 60 | + expect(nums, equals([0])); |
| 61 | + }); |
| 62 | + |
| 63 | + test('All zeros: [0,0,0] → [0,0,0]', () { |
| 64 | + final nums = [0, 0, 0]; |
| 65 | + s.sortColors(nums); |
| 66 | + expect(nums, equals([0, 0, 0])); |
| 67 | + }); |
| 68 | + |
| 69 | + test('All ones: [1,1,1] → [1,1,1]', () { |
| 70 | + final nums = [1, 1, 1]; |
| 71 | + s.sortColors(nums); |
| 72 | + expect(nums, equals([1, 1, 1])); |
| 73 | + }); |
| 74 | + |
| 75 | + test('All twos: [2,2,2] → [2,2,2]', () { |
| 76 | + final nums = [2, 2, 2]; |
| 77 | + s.sortColors(nums); |
| 78 | + expect(nums, equals([2, 2, 2])); |
| 79 | + }); |
| 80 | + |
| 81 | + // Already sorted |
| 82 | + test('Already sorted: [0,1,2] → [0,1,2]', () { |
| 83 | + final nums = [0, 1, 2]; |
| 84 | + s.sortColors(nums); |
| 85 | + expect(nums, equals([0, 1, 2])); |
| 86 | + }); |
| 87 | + |
| 88 | + // Reverse sorted |
| 89 | + test('Reverse sorted: [2,1,0] → [0,1,2]', () { |
| 90 | + final nums = [2, 1, 0]; |
| 91 | + s.sortColors(nums); |
| 92 | + expect(nums, equals([0, 1, 2])); |
| 93 | + }); |
| 94 | + |
| 95 | + // Mixed cases |
| 96 | + test('Mixed case 1: [1,0,2,1,0] → [0,0,1,1,2]', () { |
| 97 | + final nums = [1, 0, 2, 1, 0]; |
| 98 | + s.sortColors(nums); |
| 99 | + expect(nums, equals([0, 0, 1, 1, 2])); |
| 100 | + }); |
| 101 | + |
| 102 | + test('Mixed case 2: [2,1,2,0,0,1] → [0,0,1,1,2,2]', () { |
| 103 | + final nums = [2, 1, 2, 0, 0, 1]; |
| 104 | + s.sortColors(nums); |
| 105 | + expect(nums, equals([0, 0, 1, 1, 2, 2])); |
| 106 | + }); |
| 107 | + |
| 108 | + // Random cases |
| 109 | + test('Random case 1: [0,2,1,1,2,0] → [0,0,1,1,2,2]', () { |
| 110 | + final nums = [0, 2, 1, 1, 2, 0]; |
| 111 | + s.sortColors(nums); |
| 112 | + expect(nums, equals([0, 0, 1, 1, 2, 2])); |
| 113 | + }); |
| 114 | + |
| 115 | + test('Random case 2: [1,2,0,1,2,0,1] → [0,0,1,1,1,2,2]', () { |
| 116 | + final nums = [1, 2, 0, 1, 2, 0, 1]; |
| 117 | + s.sortColors(nums); |
| 118 | + expect(nums, equals([0, 0, 1, 1, 1, 2, 2])); |
| 119 | + }); |
| 120 | + }); |
| 121 | +} |
0 commit comments