<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>mhiro216</author_name>
  <author_url>https://blog.hatena.ne.jp/mhiro216/</author_url>
  <blog_title>オットセイの経営日誌</blog_title>
  <blog_url>https://mhiro216.hatenablog.com/</blog_url>
  <categories>
    <anon>LeetCode</anon>
  </categories>
  <description>ビット表現祭りその2。 https://leetcode.com/problems/number-of-1-bits/ Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight). Example 1: Input: 00000000000000000000000000001011 Output: 3 Explanation: The input binary string 00000000000000000…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmhiro216.hatenablog.com%2Fentry%2F2019%2F08%2F31%2F233537&quot; title=&quot;LeetCode / Number of 1 Bits - オットセイの経営日誌&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url>https://chart.apis.google.com/chart?cht=tx&amp;chl=%20O%28n%20%2A%20h%29</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2019-08-31 23:35:37</published>
  <title>LeetCode / Number of 1 Bits</title>
  <type>rich</type>
  <url>https://mhiro216.hatenablog.com/entry/2019/08/31/233537</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
