Skip to content

feat: add solutions of javascript to leetcode problem: 面试题 01.02. 判定是否互为字符重排-哈希表 #362

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.

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 2 commits into from
Apr 30, 2021

Conversation

zhaocchen
Copy link
Member

No description provided.

@@ -83,8 +83,18 @@ class Solution {

### **...**
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
### **...**
### **JavaScript**

let n1 = s1.length, n2 = s2.length;
if (n1 != n2) return false;
let counter = {};
for (let i=0; i<n1; i++) {
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for (let i=0; i<n1; i++) {
for (let i = 0; i < n1; i++) {

@yanglbme yanglbme merged commit b5915df into doocs:main Apr 30, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants