Counting Bits leetcode java solutuion

Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.

Example 1:

Input: n = 2
Output: [0,1,1]
Explanation:
0 --> 0
1 --> 1
2 --> 10

Example 2:

Input: n = 5
Output: [0,1,1,2,1,2]
Explanation:
0 --> 0
1 --> 1
2 --> 10
3 --> 11
4 --> 100
5 --> 101

Constraints:

0 <= n <= 105

Solution:

package com.leetcode.practice;

import java.util.Arrays;

public class leetcode338{

public static void main(String[] args) {

int[] ans=countBits(5);

System.out.println(Arrays.toString(ans));

}

public static int[] countBits(int n) {

int[] arr=new int[n+1];

for(int i=0; i<=n; i++)

{

arr[i]=Scount(i);

}

return arr;

}

static int Scount(int i) {

int count=0;

while(i>0)

{

count++;

i=i&(i-1);

}

return count;

}

Also Read: Sorting the Sentence Java Solution

Github Link: Click here

Counting Bits leetcode java solutuion