C++ 2. Write a function named “isNumberString” that accepts a C-string (an array of characters with a NULL terminating character)and returns true if that C-string contains a valid integer number and false otherwise. A valid number string is defined as a string starting with an optional sign of '+' or '-' and contains only digits after that. For example, "123456" or "+1234" will return true and 1 "-4567" will return true and -1 "0" will return true and 0 "123A" will return false and 0 "A456" will return false and 0 The requirement is that you cannot use any string conversion function or method such as strtoi or strlen. You are required to do the check yourself by examining each character in the C-string and performing the validity check in the method. This function works with C-string and not string class. It also means that you should not pass the size of the string to the function as a parameter. Please use only pointer notation. Please do not use or refer the string class in this function.
C++
2. Write a function named “isNumberString” that accepts a C-string (an array of characters
with a NULL terminating character)and returns true
if that C-string contains a valid integer number and false otherwise.
A valid number string is defined as a string starting with an optional sign of '+' or
'-' and contains only digits after that.
For example, "123456" or "+1234" will return true and 1
"-4567" will return true and -1
"0" will return true and 0
"123A" will return false and 0
"A456" will return false and 0
The requirement is that you cannot use any string conversion function or
method such as strtoi or strlen. You are required to do the check yourself
by examining each character in the C-string and
performing the validity check in the method.
This function works with C-string and not string class.
It also means that you should not pass the size of the string to the function as a parameter.
Please use only pointer notation. Please do not use or refer the string class in this function.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
