Skip to content

fix: update solutions to lc problem: No.3043 #3557

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 14 commits into from
Sep 24, 2024
Merged

fix: update solutions to lc problem: No.3043 #3557

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
14 commits
Select commit Hold shift + click to select a range
a21b1e8
Create Solution.js
07subhadip Sep 23, 2024
324cc2b
Create Solution.js
07subhadip Sep 23, 2024
80634a8
Update Solution.js
yanglbme Sep 24, 2024
3680e8b
Delete solution/Solution.js
yanglbme Sep 24, 2024
7a18121
Update README.md
yanglbme Sep 24, 2024
46a2880
Update README_EN.md
yanglbme Sep 24, 2024
f4825db
Create Solution.js
07subhadip Sep 24, 2024
8c24319
Update Solution.ts
07subhadip Sep 24, 2024
d6f4c63
Merge branch 'main' into main
yanglbme Sep 24, 2024
9223b1f
style: format code and docs with prettier
yanglbme Sep 24, 2024
fa67038
Update Solution.ts
yanglbme Sep 24, 2024
cc15596
Update Solution.js
yanglbme Sep 24, 2024
313f6b5
Update README.md
yanglbme Sep 24, 2024
63ef10d
Update README_EN.md
yanglbme Sep 24, 2024
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
35 changes: 31 additions & 4 deletions solution/3000-3099/3043.Find the Length of the Longest Common Prefix/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -176,14 +176,14 @@ func longestCommonPrefix(arr1 []int, arr2 []int) (ans int) {
function longestCommonPrefix(arr1: number[], arr2: number[]): number {
const s: Set<number> = new Set<number>();
for (let x of arr1) {
for (; x; x = (x / 10) | 0) {
s.add(x % 10);
for (; x; x = Math.floor(x / 10)) {
s.add(x);
}
}
let ans: number = 0;
for (let x of arr2) {
for (; x; x = (x / 10) | 0) {
if (s.has(x % 10)) {
for (; x; x = Math.floor(x / 10)) {
if (s.has(x)) {
ans = Math.max(ans, Math.floor(Math.log10(x)) + 1);
}
}
Expand All @@ -192,6 +192,33 @@ function longestCommonPrefix(arr1: number[], arr2: number[]): number {
}
```

#### JavaScript

```js
/**
* @param {number[]} arr1
* @param {number[]} arr2
* @return {number}
*/
var longestCommonPrefix = function (arr1, arr2) {
const s = new Set();
for (let x of arr1) {
for (; x; x = Math.floor(x / 10)) {
s.add(x);
}
}
let ans = 0;
for (let x of arr2) {
for (; x; x = Math.floor(x / 10)) {
if (s.has(x)) {
ans = Math.max(ans, Math.floor(Math.log10(x)) + 1);
}
}
}
return ans;
};
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
35 changes: 31 additions & 4 deletions solution/3000-3099/3043.Find the Length of the Longest Common Prefix/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -174,14 +174,14 @@ func longestCommonPrefix(arr1 []int, arr2 []int) (ans int) {
function longestCommonPrefix(arr1: number[], arr2: number[]): number {
const s: Set<number> = new Set<number>();
for (let x of arr1) {
for (; x; x = (x / 10) | 0) {
s.add(x % 10);
for (; x; x = Math.floor(x / 10)) {
s.add(x);
}
}
let ans: number = 0;
for (let x of arr2) {
for (; x; x = (x / 10) | 0) {
if (s.has(x % 10)) {
for (; x; x = Math.floor(x / 10)) {
if (s.has(x)) {
ans = Math.max(ans, Math.floor(Math.log10(x)) + 1);
}
}
Expand All @@ -190,6 +190,33 @@ function longestCommonPrefix(arr1: number[], arr2: number[]): number {
}
```

#### JavaScript

```js
/**
* @param {number[]} arr1
* @param {number[]} arr2
* @return {number}
*/
var longestCommonPrefix = function (arr1, arr2) {
const s = new Set();
for (let x of arr1) {
for (; x; x = Math.floor(x / 10)) {
s.add(x);
}
}
let ans = 0;
for (let x of arr2) {
for (; x; x = Math.floor(x / 10)) {
if (s.has(x)) {
ans = Math.max(ans, Math.floor(Math.log10(x)) + 1);
}
}
}
return ans;
};
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
22 changes: 22 additions & 0 deletions solution/3000-3099/3043.Find the Length of the Longest Common Prefix/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
/**
* @param {number[]} arr1
* @param {number[]} arr2
* @return {number}
*/
var longestCommonPrefix = function (arr1, arr2) {
const s = new Set();
for (let x of arr1) {
for (; x; x = Math.floor(x / 10)) {
s.add(x);
}
}
let ans = 0;
for (let x of arr2) {
for (; x; x = Math.floor(x / 10)) {
if (s.has(x)) {
ans = Math.max(ans, Math.floor(Math.log10(x)) + 1);
}
}
}
return ans;
};
8 changes: 4 additions & 4 deletions solution/3000-3099/3043.Find the Length of the Longest Common Prefix/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,14 +1,14 @@
function longestCommonPrefix(arr1: number[], arr2: number[]): number {
const s: Set<number> = new Set<number>();
for (let x of arr1) {
for (; x; x = (x / 10) | 0) {
s.add(x % 10);
for (; x; x = Math.floor(x / 10)) {
s.add(x);
}
}
let ans: number = 0;
for (let x of arr2) {
for (; x; x = (x / 10) | 0) {
if (s.has(x % 10)) {
for (; x; x = Math.floor(x / 10)) {
if (s.has(x)) {
ans = Math.max(ans, Math.floor(Math.log10(x)) + 1);
}
}
Expand Down
Loading