feat: PalindromeNumber Solution Added

[tiazahmd]

Left space and complexity analysis as to-do since I don't know how to do them yet.

---

View rendered src/PalindromeNumber/README.md

[MrHeer]

1. test code with Test.h
2. update README.md
3. format code with clang-format
4. check markdown documentions with markdownlint

[tiazahmd]

All of the following requested changes are made:

• test code with Test.h
• update README.md
• format code with clang-format
• check markdown documentions with markdownlint

[MrHeer]

you're not update README.md

[tiazahmd]

The following changes have been made to the new commit:

• Updated README.md with time and space complexity
• Function now returns bool instead of string
• Removed ct and digCount and made filling vector easier and faster
• Added one more test cases, with updated expectation and output & expectation type

[MrHeer]

@tiazahmd Can you help update https://github.com/XFreeCoder/LeetCode/blob/master/README.md

Please reset .clang-format

[tiazahmd]

Updated master README and reset .clang-format.

[Zhongnibug]

I think if you could define that a number,xr, which read forward, equal to x reading backward,you will omit vector.And when xr is equal to x,x is a Palindrome Number.

[tiazahmd]

I will be out of town until Tuesday. I’ll make the suggested changes once I’m back.

[tiazahmd]

Made suggested changes. I couldn't get @Zhongnibug 's solution yet. Let me know if you guys still want me to work on that, or if the current solution suffices.

[MrHeer]

Suggested change

	};
	}

[MrHeer]

@tiazahmd Do you think this is okay, I have tested AC on leetcode.

Suggested change

	for (int i = 0; i < vec.size(); i++) {
	if (i == vec.size() - 1)
	return true;
	else if (vec[i] != vec[vec.size() - 1 - i])
	return false;
	}
	} else {
	return false;
	}
	return false;
	for (int i = 0; i < vec.size() / 2; i++) {
	if (vec[i] != vec[vec.size() - 1 - i])
	return false;
	}
	return true;
	} else {
	return false;
	}

[MrHeer]

Made suggested changes. I couldn't get @Zhongnibug 's solution yet. Let me know if you guys still want me to work on that, or if the current solution suffices.

Your solution is okey, but @Zhongnibug 's solution is better. Of course, for the best code, if you want to continue to optimize, you can refer to the official solution

[MrHeer]

Ping @tiazahmd

[MrHeer]

Suggested change

	test("Test case: ", s.isPalindrome(121), true);
	test("Test case: ", s.isPalindrome(120), false);
	test("Test case: ", s.isPalindrome(-121), false);
	test("Test case: ", s.isPalindrome(11), true);
	test("Test case: ", s.isPalindrome(9), true);
	test("Test case: ", s.isPalindrome(0), true);
	test("Test case: ", s.isPalindrome(10022001), true);
	test("Test case: ", s.isPalindrome(1001), true);
	test("Test case 1", s.isPalindrome(121), true);
	test("Test case 2", s.isPalindrome(120), false);
	test("Test case 3", s.isPalindrome(-121), false);
	test("Test case 4", s.isPalindrome(11), true);
	test("Test case 5", s.isPalindrome(9), true);
	test("Test case 6", s.isPalindrome(0), true);
	test("Test case 7", s.isPalindrome(10022001), true);
	test("Test case 8", s.isPalindrome(1001), true);

[MrHeer]

@tiazahmd Hello, Is there problem?

[tiazahmd]

@tiazahmd Hello, Is there problem?

No problem. Is there something I have to do to finish this?

[MrHeer]

@tiazahmd I hope you can adopt my suggestion.
After update, you can Resolve conversation