728. Self Dividing Numbers
来源:互联网 发布:python 使用多个def的 编辑:程序博客网 时间:2024/05/29 13:25
A self-dividing number is a number that is divisible by every digit it contains.
For example, 128 is a self-dividing number because 128 % 1 == 0
, 128 % 2 == 0
, and 128 % 8 == 0
.
Also, a self-dividing number is not allowed to contain the digit zero.
Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.
Example 1:
Input: left = 1, right = 22Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
Note:
1 <= left <= right <= 10000
.
即遍历数组,对每个数字进行判断,符合要求的推进要返回的数组。
判断条件的设置使用循环的方式,循环终止的条件应当是每次取余得一位数,那一位数为零则判断停止,循环内部拿到那一位数后对整体数字进行取余,若不为零同样跳出循环。
出循环后通过判断剩下的位数的数字是否空了,若空了则说明符合条件,推入返回数字,否则不满足。
class Solution {public: vector<int> selfDividingNumbers(int left, int right) { vector<int> re; for(int i=left; i<=right;i++){ int temp=i; while(temp !=0 && temp %10 != 0){ if(i % (temp % 10) != 0) break; temp = temp / 10; } if(temp == 0) re.push_back(i); } return re; }};
阅读全文
0 0
- 728. Self Dividing Numbers
- 728. Self Dividing Numbers
- 728. Self Dividing Numbers
- 728. Self Dividing Numbers
- 728. Self Dividing Numbers
- 728. Self Dividing Numbers
- 728. Self Dividing Numbers
- 【LeetCode】728. Self Dividing Numbers
- 【LeetCode】728. Self Dividing Numbers
- leetcode-728. Self Dividing Numbers
- leetcode 728. Self Dividing Numbers
- Leetcode:728. Self Dividing Numbers
- LeetCode 728. Self Dividing Numbers
- [LeetCode] 728.Self Dividing Numbers
- LeetCode 728. Self Dividing Numbers
- [LeetCode]728. Self Dividing Numbers
- LeetCode | 728. Self Dividing Numbers
- [LeetCode] 728. Self Dividing Numbers
- Intellij IDEA ,按Ctrl+左键,不能进入类或方法的【解决办法】,提示Cannot find declaration to go to
- 内存对齐
- JQ定时请求数据,并根据返回的数据停止请求
- WPS/Word等的使用
- ORA-39097 ORA-39065 ORA-01427
- 728. Self Dividing Numbers
- 软件PWM控制led
- linux实时检测系统IO负载-------iostat命令
- Permission is only granted to system apps
- Python_test02-03
- 源代码管理工具之SVN
- 闭包——嵌套函数
- mysql悲观锁以及乐观锁总结和实践
- jQuery动态显示和隐藏div