Saturday, 2 May 2020

Brian Kernighan’s Algorithm | Python

Code: class Solution: def countBits(self, num: int) -> List[int]: bum=[]; i=0; while(i<=num): bum.append(i); i=i+1; output=[]; for i in bum: count=0; while(i>0): i=i&i-1; count+=1;#count=count+1; output.append(count); return output;

Number of 1 Bits https://leetcode.com/problems/number-... Counting Bits https://leetcode.com/problems/countin... Code is given in the comment section. Python for beginners: https://www.youtube.com/watch?v=egq7Z...

Telegram: https://t.me/clcoding_python https://www.facebook.com/pirawenpython/

0 Comments:

Post a Comment

Codecademy Code Foundations

Popular Posts

Categories

Android (23) AngularJS (1) Assembly Language (2) Books (10) C (75) C# (12) C++ (81) Course (1) Data Strucures (4) Downloads (1) Engineering (13) flutter (1) FPL (17) Hadoop (1) HTML&CSS (38) IS (25) Java (87) Leet Code (4) PHP (20) Projects (10) Python (249) R (69) Selenium Webdriver (2) Software (14) SQL (27)