Refactor

tests/s0209_minimum_size_subarray_sum.cpp

@@ -6,7 +6,7 @@ TEST(Problem209, Case1) {
   int target{7};
   vector<int> nums{2, 3, 1, 2, 4, 3};
   int o{2};
-  Solution solution;
+  S0209 solution;
   EXPECT_EQ(solution.minSubArrayLen(target, nums), o);
 }
 
@@ -14,7 +14,7 @@ TEST(Problem209, Case2) {
   int target{4};
   vector<int> nums{1, 4, 4};
   int o{1};
-  Solution solution;
+  S0209 solution;
   EXPECT_EQ(solution.minSubArrayLen(target, nums), o);
 }
 
@@ -22,7 +22,7 @@ TEST(Problem209, Case3) {
   int target{11};
   vector<int> nums{1, 1, 1, 1, 1, 1, 1, 1};
   int o{0};
-  Solution solution;
+  S0209 solution;
   EXPECT_EQ(solution.minSubArrayLen(target, nums), o);
 }
 
@@ -30,6 +30,6 @@ TEST(Problem209, Case4) {
   int target{11};
   vector<int> nums{1, 2, 3, 4, 5};
   int o{3};
-  Solution solution;
+  S0209 solution;
   EXPECT_EQ(solution.minSubArrayLen(target, nums), o);
 }