Zamar zamar-roura
zamar-roura
/ cassidoo-259.py
Last active
August 1, 2022 19:34
Given an integer n, count the total number of 1 digits appearing in all non-negative integers less than or equal to n.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import math | |
| """ | |
| Dirty and quick way with strings | |
| """ | |
| def numberOfOnesDirty(n): | |
| sum = 0 | |
| for i in range(n+1): | |
| sum += str(i).count('1') |