Concatenate the numbers in the order `[2, 8, 16]` to get the result `"10100010000"`, which is the binary representation of 1296.

Constraints

nums.length == 3
1 <= nums[i] <= 127

Solution

Method 1 – Permutation and Binary Concatenation

Intuition

Since the array has only 3 elements, we can try all possible orders (permutations) to concatenate their binary representations and find the maximum value. For each permutation, we convert each number to its binary string, concatenate them, and interpret the result as a binary number.

Approach

Generate all permutations of the input array nums (there are only 6 for 3 elements).
For each permutation:
- Convert each number to its binary string (no leading zeros).
- Concatenate the binary strings in the order of the permutation.
- Convert the concatenated string to an integer (base 2).
- Track the maximum value found.
Return the maximum value.

Code

[{"language":"C++","code":"class Solution {\npublic:\n    int maximumBinaryNumber(vector<int>& nums) {\n        int ans = 0;\n        sort(nums.begin(), nums.end());\n        do {\n            string s;\n            for (int x : nums) s += bitset<32>(x).to_string().substr(bitset<32>(x).to_string().find('1'));\n            ans = max(ans, (int)stoll(s, nullptr, 2));\n        } while (next_permutation(nums.begin(), nums.end()));\n        return ans;\n    }\n};","lang":"cpp","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F975

Related Tags