Thursday, May 19, 2022

Kernighans Algorithm










package pep.Day81;

import java.util.Scanner;

public class Kernighans_Algorithm {
public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
int n = sc.nextInt();

int ans = 0;

while (n > 0) {
int rmsbm = n & -n;
ans++;
n -= rmsbm;
}

System.out.println(ans);
}
}

No comments:

Post a Comment

Diagonal Traversal

 eg.  1       2       3       4 5      6       7       8 9    10    11     12 13  14   15    16 Output: 1 6 11 16 2 7 12 3 8 4  Approach:...