Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit3309c39

Browse files
committed
Easy and tricky questions, add 344, 349, 338
1 parent957122c commit3309c39

File tree

5 files changed

+143
-0
lines changed

5 files changed

+143
-0
lines changed

‎Easy/344-reverseString.js‎

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
/**
2+
*@param {string} s
3+
*@return {string}
4+
*/
5+
varreverseString=function(s){
6+
returns.split('').reverse().join('');
7+
};

‎Easy/349-intersectionTwoArrays.js‎

Lines changed: 61 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,61 @@
1+
/**
2+
*@param {number[]} nums1
3+
*@param {number[]} nums2
4+
*@return {number[]}
5+
*/
6+
// use hashset idea, O(N)
7+
varintersection=function(nums1,nums2){
8+
// Note ES5 doesn't have set
9+
varset1=newSet();
10+
varinterSet=newSet();
11+
for(vari=0;i<nums1.length;i++){
12+
set1.add(nums1[i]);
13+
}
14+
15+
for(varj=0;j<nums2.length;j++){
16+
if(set1.has(nums2[j])){
17+
interSet.add(nums2[j]);
18+
}
19+
}
20+
21+
varresult=[];
22+
interSet.forEach(function(item){
23+
result.push(item);
24+
});
25+
26+
returnresult;
27+
};
28+
29+
// solution 2: sort first. O(nlogn)
30+
varintersection=function(nums1,nums2){
31+
// Note ES5 doesn't have set
32+
varinterSet=newSet();
33+
nums1.sort(comparator);
34+
nums2.sort(comparator);
35+
vari=0;
36+
varj=0;
37+
38+
while(i<nums1.length){
39+
if(j===nums2.length)break;
40+
if(nums1[i]<nums2[j]){
41+
i++;
42+
}elseif(nums1[i]>nums2[j]){
43+
j++;
44+
}else{
45+
interSet.add(nums1[i]);
46+
i++;
47+
j++;
48+
}
49+
}
50+
51+
varresult=[];
52+
interSet.forEach(function(item){
53+
result.push(item);
54+
});
55+
56+
returnresult;
57+
};
58+
59+
varcomparator=function(a,b){
60+
returna-b;
61+
};
Lines changed: 56 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,56 @@
1+
/**
2+
*@param {number[]} nums1
3+
*@param {number[]} nums2
4+
*@return {number[]}
5+
*/
6+
varintersect=function(nums1,nums2){
7+
varhashMap={};
8+
for(vari=0;i<nums1.length;i++){
9+
if(hashMap.hasOwnProperty(nums1[i])){
10+
hashMap[nums1[i]]++;
11+
}else{
12+
hashMap[nums1[i]]=1;
13+
}
14+
}
15+
varhashMap2={};
16+
for(i=0;i<nums2.length;i++){
17+
if(hashMap2.hasOwnProperty(nums2[i])){
18+
hashMap2[nums2[i]]++;
19+
}else{
20+
hashMap2[nums2[i]]=1;
21+
}
22+
}
23+
24+
varresult=[];
25+
for(varkeyinhashMap){
26+
if(!hashMap2.hasOwnProperty(key))continue;
27+
varnumAppears=Math.min(hashMap[key],hashMap2[key]);
28+
for(i=0;i<numAppears;i++){
29+
result.push(parseInt(key));
30+
}
31+
}
32+
33+
returnresult;
34+
};
35+
36+
// A better and more concise solution. One hashmap needed.
37+
varintersect=function(nums1,nums2){
38+
varhashMap={};
39+
for(vari=0;i<nums1.length;i++){
40+
if(hashMap.hasOwnProperty(nums1[i])){
41+
hashMap[nums1[i]]++;
42+
}else{
43+
hashMap[nums1[i]]=1;
44+
}
45+
}
46+
47+
varresult=[];
48+
for(i=0;i<nums2.length;i++){
49+
if(hashMap.hasOwnProperty(nums2[i])&&hashMap[nums2[i]]>0){
50+
result.push(nums2[i]);
51+
hashMap[nums2[i]]--;
52+
}
53+
}
54+
55+
returnresult;
56+
};

‎Medium/338-countingBits.js‎

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
/**
2+
* Solution: f(i) = f(i/2) + i % 2;
3+
* the bit nums = the bit nums of half of the number, and plus 1 if the last digit of the bit number is 1.
4+
*
5+
*@param {number} num
6+
*@return {number[]}
7+
*/
8+
varcountBits=function(num){
9+
varresult=[0];
10+
for(vari=1;i<=num;i++){
11+
result[i]=result[i>>1]+(i&1);
12+
}
13+
14+
returnresult;
15+
};

‎README.md‎

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -66,6 +66,9 @@
6666
*[299. Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/) -[Solution](./Easy/299-bullsandCows.js)
6767
*[303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) -[Solution](./Easy/303-rangeSumQuery.js)
6868
*[328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) -[Solution](./Easy/328-oddevenLinkedList.js)
69+
*[344. Reverse String](https://leetcode.com/problems/reverse-string/) -[Solution](./Easy/344-reverseString.js)
70+
*[349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) -[Solution](./Easy/349-intersectionTwoArrays.js)
71+
*[350. Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) -[Solution](./Easy/349-intersectionTwoArraysII.js)
6972

7073
#####Medium
7174
*[1. Two Sum](https://leetcode.com/problems/two-sum/) -[Solution](./Medium/1-twoSum.js)
@@ -164,6 +167,7 @@
164167
*[318. Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) -[Solution](./Medium/318-maximumProductWordLengths.js)
165168
*[319. Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) -[Solution](./Medium/319-bulbSwitcher.js)
166169
*[337. House Robber III](https://leetcode.com/problems/house-robber-iii/) -[Solution](./Medium/337-houseRobberIII.js)
170+
*[338. Counting Bits](https://leetcode.com/problems/counting-bits/) -[Solution](./Medium/338-countingBits.js)
167171

168172
#####Hard
169173
*[23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) -[Solution](./Hard/23-MergeKSortedLists.js)

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp