首页 > 代码库 > leetcode338
leetcode338
public class Solution { public int[] CountBits(int num) { var ary = new int[num + 1]; for (int i = 0; i <= num; i++) { var count = 0; var cur = i; do { var c = cur % 2; if (c == 1) { count++; } cur = cur / 2; } while (cur != 0); ary[i] = count; } return ary; } }
https://leetcode.com/problems/counting-bits/#/description
leetcode338
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。