human
I found an interesting problem on https://leetcode.com/problems/nth-digit/:
Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... 

Note:
n is positive and will fit within the range of a 32-bit signed integer (n < 231).

Example 1:

Input:
3

Output:
3


Example 2:

Input:
11

Output:
0

Explanation:
The 11th digit of the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... is a 0, which is part of the number 10.

I tried it in Python, but could not do it. Can you solve it?

 Write me a Python code to find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,?
assistant
#Here is Python code to find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, .

class Solution:
     def findNthDigit(self, n):
         """
         :type n: int
         :rtype: int
         """
         n -= 1
         for digits in range(1, 11):
             first = 10**(digits - 1)
             if n < 9 * first * digits:
                 return int(str(first + n//digits)[n%digits])
             n -= 9 * first * digits