feat: add solutions to lc problem: No.1545 (#3652)

Author: rain84

solution/1500-1599/1545.Find Kth Bit in Nth Binary String/README.md

@@ -215,4 +215,27 @@ function findKthBit(n: number, k: number): string {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### 方法二：位运算
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+const findKthBit = (n: number, k: number): string =>
+    String((((k / (k & -k)) >> 1) & 1) ^ (k & 1) ^ 1);
+```
+
+#### JavaScript
+
+```js
+const findKthBit = (n, k) => String((((k / (k & -k)) >> 1) & 1) ^ (k & 1) ^ 1);
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1500-1599/1545.Find Kth Bit in Nth Binary String/README_EN.md

@@ -201,4 +201,27 @@ function findKthBit(n: number, k: number): string {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Bit Manipulation
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+const findKthBit = (n: number, k: number): string =>
+    String((((k / (k & -k)) >> 1) & 1) ^ (k & 1) ^ 1);
+```
+
+#### JavaScript
+
+```js
+const findKthBit = (n, k) => String((((k / (k & -k)) >> 1) & 1) ^ (k & 1) ^ 1);
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1500-1599/1545.Find Kth Bit in Nth Binary String/Solution2.js

@@ -0,0 +1 @@
+const findKthBit = (n, k) => String((((k / (k & -k)) >> 1) & 1) ^ (k & 1) ^ 1);

solution/1500-1599/1545.Find Kth Bit in Nth Binary String/Solution2.ts

@@ -0,0 +1,2 @@
+const findKthBit = (n: number, k: number): string =>
+    String((((k / (k & -k)) >> 1) & 1) ^ (k & 1) ^ 1);