problemscpp
A collection of my answers to algorithm problems in c++.
| 函数
leetcode::rearrange_array_elements_by_sign 命名空间参考

LeetCode 5991. 按符号重排数组 更多...

class  Solution
 

函数

 TEST (rearrange_array_elements_by_sign, case1)
 
 TEST (rearrange_array_elements_by_sign, case2)
 

详细描述

LeetCode 5991. 按符号重排数组

函数说明

◆ TEST() [1/2]

leetcode::rearrange_array_elements_by_sign::TEST ( rearrange_array_elements_by_sign  ,
case1   
)

在文件 leetcode_test.cpp965 行定义.

965 {
966 int input[] = {3, 1, -2, -5, 2, -4};
967 auto vec_input = vector(begin(input), end(input));
968 int output[] = {3, -2, 1, -5, 2, -4};
969 const auto vec_output = vector(begin(output), end(output));
970 ASSERT_EQ(vec_output, Solution::rearrangeArray(vec_input));
971 }

引用了 leetcode::rearrange_array_elements_by_sign::Solution::rearrangeArray().

◆ TEST() [2/2]

leetcode::rearrange_array_elements_by_sign::TEST ( rearrange_array_elements_by_sign  ,
case2   
)

在文件 leetcode_test.cpp973 行定义.

973 {
974 int input[] = {-1, 1};
975 auto vec_input = vector(begin(input), end(input));
976 int output[] = {1, -1};
977 const auto vec_output = vector(begin(output), end(output));
978 ASSERT_EQ(vec_output, Solution::rearrangeArray(vec_input));
979 }

引用了 leetcode::rearrange_array_elements_by_sign::Solution::rearrangeArray().