Example #1
0
int main()
{
    Solution s;

    int num = 123;
    int r = s.reverse(num);
    cout << "r=" << r <<endl;
  
    num = -456;
    r = s.reverse(num);
    cout << "r=" << r <<endl;


    num = 1534236469;
    r = s.reverse(num);
    cout << "r=" << r <<endl;

    num = 3;
    r = s.reverse(num);
    cout << "r=" << r <<endl;

    num = -3;
    r = s.reverse(num);
    cout << "r=" << r <<endl;

	return 0;
}
void testReverse(){
    Solution testSolution;
    int test1 = 12321, result1 = testSolution.reverse(test1);
    int test2 = 1000000009, result2 = testSolution.reverse(test2);
    int test3 = 123000, result3 = testSolution.reverse(test3);
    int test4 = -1230, result4 = testSolution.reverse(test4);
    int test5 = -test2, result5 = testSolution.reverse(test5);
    bool flag = true;
    if(12321 != result1){
        cout<<"Wrong Ans, input value->"<<test1<<", get the value"<<result1<<endl;
        flag = false;
    }
    if(0 != result2){
        cout<<"Wrong Ans, input value->"<<test2<<", get the value"<<result2<<endl;
        flag = false;
    }
    if(321 != result3){
        cout<<"Wrong Ans, input value->"<<test3<<", get the value"<<result3<<endl;
        flag = false;
    }
    if(-321 != result4){
        cout<<"Wrong Ans, input value->"<<test4<<", get the value"<<result4<<endl;
        flag = false;
    }
    if(0 != result5){
        cout<<"Wrong Ans, input value->"<<test5<<", get the value"<< result5<<endl;
        flag = false;
    }

    if(flag){
        cout<<"All tests passed"<<endl;
    }
}
Example #3
0
int main() {
    Solution solution;
    cout << solution.reverse(100001230) << endl;
    cout << solution.reverse(INT_MAX) << endl;

    cout << solution.reverse(-12348928) << endl;
}
int main()
{
	Solution sol;
	cout << sol.reverse(123) << endl;
	cout << sol.reverse(-123) << endl;
	return 0;
}
Example #5
0
int main()
{
    int x1 = 123, x2 = -123;
    Solution s;
    cout<<"123-reverse:"<<s.reverse(x1)<<endl;
    cout<<"-123-reverse:"<<s.reverse(x2)<<endl;
    return 0;
}
Example #6
0
int main() {
    Solution sol;
    cout << (0 == sol. reverse(0)) << endl;
    cout << (321 == sol.reverse(123)) << endl;
    cout << (-321 == sol.reverse(-123)) << endl;
    cout << (1 == sol.reverse(100)) << endl;
    cout << endl;
}
Example #7
0
int main() 
{
    Solution s;
    cout<<s.reverse(-2147483412)<<endl;
    cout<<s.reverse(-100)<<endl;
    cout<<s.reverse(10)<<endl;
    return 0;
}
Example #8
0
int main(){
    Solution st;
    cout<<st.reverse(123)<<endl;
    cout<<st.reverse(-123)<<endl;
    cout<<st.reverse(10000)<<endl;
    cout<<st.reverse(-1000)<<endl;
    return 0;
}
TEST(reverse_integer, simple_case) {
    Solution s;
    
    EXPECT_EQ(321, s.reverse(123));
    EXPECT_EQ(2, s.reverse(2000));
    EXPECT_EQ(-1, s.reverse(-1));
    EXPECT_EQ(-12, s.reverse(-21));
    EXPECT_EQ(2147483647, s.reverse(2147483647));
}
Example #10
0
TEST(ReverseInteger, Functionality) {
  EXPECT_EQ(s.reverse(1000000003), 0);
  EXPECT_EQ(s.reverse(0), 0);
  EXPECT_EQ(s.reverse(-7), -7);
  EXPECT_EQ(s.reverse(10), 1);
  EXPECT_EQ(s.reverse(-10), -1);
  EXPECT_EQ(s.reverse(INT_MAX), 0);
  EXPECT_EQ(s.reverse(INT_MIN), 0);
}
Example #11
0
int main() {
    Solution s;

    std::cout << s.reverse(123) << std::endl;
    std::cout << s.reverse(-123) << std::endl;
    std::cout << s.reverse(3) << std::endl;
    std::cout << s.reverse(1534236469) << std::endl;

    return 0;
}
Example #12
0
int main()
{

    Solution sl;
    cout <<(sl.reverse(-123)) << endl;
    cout <<(sl.reverse(1534236469)) << endl;
    cout <<(sl.reverse(-2147483648)) << endl;
    long long m = -2147483648;
    m = abs(m);
    cout <<"m\t" << m <<endl;
}
Example #13
0
int main(int argc, char const *argv[]) {
    Solution sol;

    int nums[] = {
        0, -0, // zero
        10, -10, // end with zero
        123, -123, // normal condition
        1000000003, -1000000003, // overlow, and sign will change
        1534236469, // overflow but sign will not chang
        1463847412, -1463847412 // reverse between -2147483648 ~ 2147483647
    };
    int results[] = {
        0, 0, // zero
        1, -1, // no prefix zero
        321, -321, // normal condition
        0, 0, // return 0 when overflow
        0,
        2147483641, -2147483641
    };
    int count = sizeof(nums)/sizeof(nums[0]);
    int failed = 0;
    int result;
    for (int i = 0; i < count; i++) {
        result = sol.reverse(nums[i]);
        if (result != results[i]) {
            failed++;
            cout << "Test: " << nums[i] << ", expect: " << results[i] << ", while returned: " << result << endl;
        }
    }
    cout << "Test " << count << " cases: " << (count - failed) << " success, " << failed << " failed." << endl;
}
Example #14
0
int main()
    {
        Solution s;

        cout << "res is " << s.reverse(1534236469);
        return 0;
    }
Example #15
0
int main(int argc, char *argv[])
{
    int x1 = 123;
    int x2 = -123;
    int x3 = 1534236469;
    int x4 = -1563847412;

    Solution s;

    cout << s.reverse(x1) << endl;
    cout << s.reverse(x2) << endl;
    cout << s.reverse(x3) << endl;
    cout << s.reverse(x4) << endl;

    return 0;
}
Example #16
0
int main() {
    Solution sb;

    cout << "return "<<sb.reverse(1)<<"\n";

    return 0;
}
Example #17
0
int main()
{
    int x = 1534236469;
    Solution so;
    cout << so.reverse(x) << endl;
    return 0;
}
Example #18
0
int main(int argc, char *argv[])
{
	Solution so;
	std::cout << so.reverse(123456) << std::endl;
	std::cout << so.reverse(-12345) << std::endl;
	return 0;
}
Example #19
0
int main()
{
	Solution s;
	cout << s.reverse(2147482345) << endl;
	system("pause");
	return 0;
}
int main()
{
	Solution sol;
	cout << sol.reverse(1534236469) << endl;
	//cout << sol.reverse(-2147483648) << endl;
	return 0;
}
Example #21
0
int main()
{
	Solution s;
	auto i = s.reverse(1534236469);
	printf("ans %d \n", i);
	return 0;
}
Example #22
0
int main()
{
    int x = -2147483648;
    Solution solution;
    cout << solution.reverse(x) << endl;
    return 0;
}
Example #23
0
int main(int argc, char** argv)
{
	Solution s;
	int n = atoi(argv[1]);
	std::cout << s.reverse(n) << std::endl;
	return 0;
}
Example #24
0
int _tmain(int argc, _TCHAR* argv[])
{
	Solution test;
	int f = -2147483647;
	cout<<test.reverse(f)<<endl;
	return 0;
}
Example #25
0
int main(){
	int var = 987654321;

	Solution sol;
	cout << sol.reverse(var);
	return 0;
}
Example #26
0
int main() {
    Solution sol;
    std::vector<int> tests = {123, -123, 10, 100, 1000000003};
    for (auto item : tests) {
        std::cout << item << ", " << sol.reverse(item) << std::endl;
    }
    return 0;
}
int main() {
    cout << "Hello world" << endl;

    Solution * ss = new Solution;
    ss->reverse(-2147483648);

    return 0;
}
Example #28
0
int main(int argc, char const* argv[])
{
    int a;
    cin>>a;
    Solution solution;
    cout<<solution.reverse(a)<<endl;
    return 0;
}
Example #29
0
int main() {
	int x;
	Solution s;
	while (cin >> x){
		cout << s.reverse(x) << endl;
	}
	return 0;
}
Example #30
0
int main() {
    char s[20];
    cin >> s;
    Solution solution;
    solution.reverse(s);
    cout << s << endl;
    return 0;
}