试图编写一个 function 来返回 n 中可被 m 整除的位数 - 太多 output - Python

Question

I'm currently trying to write a function that will take n and m as an argument and then will return the number of digits in n that are divisible by m . An example of this could be n = 305689 and m = 3. The answer here would be 4.

My program is able to get this result, but the interface I'm working is is saying that my program is running for too long or producing too much output.

Here's my program so far:

def count_divisible_digits(n, m):
    count = 0
    while n != 0:
        if (n % 10) % m == 0:
            count += 1
        #print("dbg", count, n)
        n = n // 10
    return count

Answer 1

Try converting the input n to string datatype and getting the count as follows. This should be faster.

def count_divisible_digits(n, m):
  count = 0
  string = str(n)
  if n == 0 and m == 0:
    return 0
  elif m == 0:
    return 0
  elif n == 0: 
    return 1
  elif n < 0:
    x = 1
  else:
    x = 0
    
  for i in range(x, len(string)):
    if string[i] == '.' or 0 < int(string[i]) < m:
      continue
    elif int(string[i]) % m == 0:
      count += 1      
  return count

Answer 2

Try this again, miss the 0 ✅ check now;

count =sum(1 for s in str(n) if int(s)%m==0 and int(s) >0)