Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
80 changes: 80 additions & 0 deletions solution/1900-1999/1980.Find Unique Binary String/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -192,4 +192,84 @@ public class Solution {

<!-- solution:end -->

<!-- solution:start -->

### 方法二

<!-- tabs:start -->

#### TypeScript

```ts
function findDifferentBinaryString(nums: string[]): string {
const set = new Set(nums.map(x => Number.parseInt(x, 2)));
let res = 0;

while (set.has(res)) {
res++;
}

return res.toString(2).padStart(nums[0].length, '0');
}
```

#### JavaScript

```js
function findDifferentBinaryString(nums) {
const set = new Set(nums.map(x => Number.parseInt(x, 2)));
let res = 0;

while (set.has(res)) {
res++;
}

return res.toString(2).padStart(nums[0].length, '0');
}
```

<!-- solution:end -->

<!-- tabs:end -->

<!-- solution:start -->

### 方法三

<!-- tabs:start -->

#### TypeScript

```ts
function findDifferentBinaryString(nums: string[]): string {
const res: string[] = [];

for (let i = 0; i < nums.length; i++) {
const x = nums[i][i];
res.push(x === '0' ? '1' : '0');
}

return res.join('');
}
```

#### JavaScript

```js
function findDifferentBinaryString(nums) {
const res = [];

for (let i = 0; i < nums.length; i++) {
const x = nums[i][i];
res.push(x === '0' ? '1' : '0');
}

return res.join('');
}
```

<!-- solution:end -->

<!-- tabs:end -->

<!-- problem:end -->
80 changes: 80 additions & 0 deletions solution/1900-1999/1980.Find Unique Binary String/README_EN.md
Original file line number Diff line number Diff line change
Expand Up @@ -191,4 +191,84 @@ public class Solution {

<!-- solution:end -->

<!-- solution:start -->

### Solution 2

<!-- tabs:start -->

#### TypeScript

```ts
function findDifferentBinaryString(nums: string[]): string {
const set = new Set(nums.map(x => Number.parseInt(x, 2)));
let res = 0;

while (set.has(res)) {
res++;
}

return res.toString(2).padStart(nums[0].length, '0');
}
```

#### JavaScript

```js
function findDifferentBinaryString(nums) {
const set = new Set(nums.map(x => Number.parseInt(x, 2)));
let res = 0;

while (set.has(res)) {
res++;
}

return res.toString(2).padStart(nums[0].length, '0');
}
```

<!-- solution:end -->

<!-- tabs:end -->

<!-- solution:start -->

### Solution 3

<!-- tabs:start -->

#### TypeScript

```ts
function findDifferentBinaryString(nums: string[]): string {
const res: string[] = [];

for (let i = 0; i < nums.length; i++) {
const x = nums[i][i];
res.push(x === '0' ? '1' : '0');
}

return res.join('');
}
```

#### JavaScript

```js
function findDifferentBinaryString(nums) {
const res = [];

for (let i = 0; i < nums.length; i++) {
const x = nums[i][i];
res.push(x === '0' ? '1' : '0');
}

return res.join('');
}
```

<!-- solution:end -->

<!-- tabs:end -->

<!-- problem:end -->
10 changes: 10 additions & 0 deletions solution/1900-1999/1980.Find Unique Binary String/Solution2.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
function findDifferentBinaryString(nums) {
const set = new Set(nums.map(x => Number.parseInt(x, 2)));
let res = 0;

while (set.has(res)) {
res++;
}

return res.toString(2).padStart(nums[0].length, '0');
}
10 changes: 10 additions & 0 deletions solution/1900-1999/1980.Find Unique Binary String/Solution2.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
function findDifferentBinaryString(nums: string[]): string {
const set = new Set(nums.map(x => Number.parseInt(x, 2)));
let res = 0;

while (set.has(res)) {
res++;
}

return res.toString(2).padStart(nums[0].length, '0');
}
10 changes: 10 additions & 0 deletions solution/1900-1999/1980.Find Unique Binary String/Solution3.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
function findDifferentBinaryString(nums) {
const res = [];

for (let i = 0; i < nums.length; i++) {
const x = nums[i][i];
res.push(x === '0' ? '1' : '0');
}

return res.join('');
}
10 changes: 10 additions & 0 deletions solution/1900-1999/1980.Find Unique Binary String/Solution3.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
function findDifferentBinaryString(nums: string[]): string {
const res: string[] = [];

for (let i = 0; i < nums.length; i++) {
const x = nums[i][i];
res.push(x === '0' ? '1' : '0');
}

return res.join('');
}