Find the leftmost digit that occurs in a given string.
inputString = "var_1__Int", the output should befirstDigit(inputString) = '1';inputString = "q2q-q", the output should befirstDigit(inputString) = '2';inputString = "0ss", the output should befirstDigit(inputString) = '0'.[time limit] 4000ms (py3)
[input] string inputString
A string containing at least one digit.
Guaranteed constraints:
3 ≤ inputString.length ≤ 10.
[output] char
| import re | |
| def first_digit(input_string: str): | |
| return re.search(r'\d', input_string).group() | |
| import unittest | |
| from first_digit import first_digit | |
| class TestFirstDigit(unittest.TestCase): | |
| def test_1(self): | |
| input_string = 'var_1__Int' | |
| solution = '1' | |
| result = first_digit(input_string) | |
| self.assertEqual(result, solution) | |
| def test_2(self): | |
| input_string = 'q2q-q' | |
| solution = '2' | |
| result = first_digit(input_string) | |
| self.assertEqual(result, solution) | |
| def test_3(self): | |
| input_string = '0ss' | |
| solution = '0' | |
| result = first_digit(input_string) | |
| self.assertEqual(result, solution) | |
| if __name__ == '__main__': | |
| unittest.main() |