<p>You are given an integer <code>n</code>. We reorder the digits in any order (including the original order) such that the leading digit is not zero.</p>

<p>Return <code>true</code> <em>if and only if we can do this so that the resulting number is a power of two</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 10
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
  bool reorderedPowerOf2(int n) {
    auto expect = digit_count(n);
    for (int i = 0; i < 31; i++) {
      auto cur = digit_count(1 << i);
      if (cur == expect) {
        return true;
      }
    }
    return false;
  }

private:
  vector<int> digit_count(int n) {
    vector<int> ret(10, 0);
    while (n) {
      ret[n % 10] += 1;
      n /= 10;
    }

    return ret;
  }
};

7700