Add solution #476

Author: JoshCrozier

README.md

@@ -89,6 +89,7 @@
 448|[Find All Numbers Disappeared in an Array](./0448-find-all-numbers-disappeared-in-an-array.js)|Easy|
 451|[Sort Characters By Frequency](./0451-sort-characters-by-frequency.js)|Medium|
 459|[Repeated Substring Pattern](./0459-repeated-substring-pattern.js)|Easy|
+476|[Number Complement](./0476-number-complement.js)|Easy|
 500|[Keyboard Row](./0500-keyboard-row.js)|Easy|
 541|[Reverse String II](./0541-reverse-string-ii.js)|Easy|
 551|[Student Attendance Record I](./0551-student-attendance-record-i.js)|Easy|

solutions/0476-number-complement.js

@@ -0,0 +1,21 @@
+/**
+ * 476. Number Complement
+ * https://leetcode.com/problems/number-complement/
+ * Difficulty: Easy
+ *
+ * The complement of an integer is the integer you get when you flip all the 0's to 1's
+ * and all the 1's to 0's in its binary representation.
+ *
+ * For example, The integer 5 is "101" in binary and its complement is "010" which is
+ * the integer 2.
+ *
+ * Given an integer num, return its complement.
+ */
+
+/**
+ * @param {number} num
+ * @return {number}
+ */
+var findComplement = function(num) {
+  return parseInt(num.toString(2).split('').map(n => 1 - n).join(''), 2);
+};