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

Commit8cf1b4b

Browse files
committed
add 2, 3
1 parentdb156a6 commit8cf1b4b

File tree

3 files changed

+117
-12
lines changed

3 files changed

+117
-12
lines changed

‎Medium/2-addTwoNumbers.js‎

Lines changed: 82 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,82 @@
1+
/**
2+
* Definition for singly-linked list.
3+
* function ListNode(val) {
4+
* this.val = val;
5+
* this.next = null;
6+
* }
7+
*/
8+
/**
9+
*@param {ListNode} l1
10+
*@param {ListNode} l2
11+
*@return {ListNode}
12+
*/
13+
14+
// needs improvement, it can be shorter
15+
varaddTwoNumbers=function(l1,l2){
16+
varl3=newListNode();
17+
varp3=l3;
18+
varaddOne=false;
19+
vardigitSum=0;
20+
21+
while(l1||l2){
22+
varl1Digit=0;
23+
varl2Digit=0;
24+
if(l1)l1Digit=l1.val;
25+
if(l2)l2Digit=l2.val;
26+
if(addOne){
27+
digitSum=l1Digit+l2Digit+1;
28+
}else{
29+
digitSum=l1Digit+l2Digit;
30+
}
31+
32+
if(digitSum>9){
33+
digitSum-=10;
34+
addOne=true;
35+
}else{
36+
addOne=false;
37+
}
38+
39+
varnode=newListNode(digitSum);
40+
l3.next=node;
41+
l3=node;
42+
if(l1)l1=l1.next;
43+
if(l2)l2=l2.next;
44+
}
45+
46+
if(addOne){
47+
varnode=newListNode(1);
48+
l3.next=node;
49+
}
50+
51+
returnp3.next;
52+
};
53+
54+
// a shorter and smarter Version, from LeetCode community
55+
varaddTwoNumbers=function(l1,l2){
56+
varl3=newListNode();
57+
varp3=l3;
58+
vardigitSum=0;
59+
60+
while(l1||l2){
61+
digitSum=Math.floor(digitSum/10);
62+
63+
if(l1){
64+
digitSum+=l1.val;
65+
l1=l1.next;
66+
}
67+
68+
if(l2){
69+
digitSum+=l2.val;
70+
l2=l2.next
71+
}
72+
73+
l3.next=newListNode(digitSum%10);
74+
l3=l3.next;
75+
}
76+
77+
if(Math.floor(digitSum/10)===1){
78+
l3.next=newListNode(1);
79+
}
80+
81+
returnp3.next;
82+
};

‎Medium/3-longestSubString.js‎

Lines changed: 34 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -5,17 +5,39 @@
55

66
// not accepted!!! time exceeded!
77
varlengthOfLongestSubstring=function(s){
8-
varvisitedChars={};
9-
varlen=0;
10-
for(vari=0;i<s.length;i++){
11-
if(s[i]invisitedChars){
12-
len=Math.max(len,Object.keys(visitedChars).length);
13-
i=visitedChars[s[i]];
14-
visitedChars={};
15-
}else{
16-
visitedChars[s[i]]=i;
8+
varvisitedChars={};
9+
varlen=0;
10+
for(vari=0;i<s.length;i++){
11+
if(s[i]invisitedChars){
12+
len=Math.max(len,Object.size(visitedChars));
13+
deletevisitedChars[s[i]];
14+
}
15+
visitedChars[s[i]]=i;
1716
}
18-
}
19-
20-
returnMath.max(len,Object.keys(visitedChars).length);
17+
18+
returnMath.max(len,Object.size(visitedChars));
19+
};
20+
21+
Object.size=function(obj){
22+
varsize=0,key;
23+
for(keyinobj){
24+
if(obj.hasOwnProperty(key))size++;
25+
}
26+
returnsize;
27+
};
28+
29+
// accepted, O(N)
30+
varlengthOfLongestSubstring=function(s){
31+
varvisitedChars={};
32+
varlen=0;
33+
varj=0;
34+
for(vari=0;i<s.length;i++){
35+
if(s[i]invisitedChars){
36+
len=Math.max(len,i-j);
37+
j=Math.max(j,visitedChars[s[i]]+1);
38+
}
39+
visitedChars[s[i]]=i;
40+
}
41+
42+
returnMath.max(len,s.length-j);
2143
};

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -64,6 +64,7 @@
6464

6565
#####Medium
6666
*[1. Two Sum](https://leetcode.com/problems/two-sum/) -[Solution](./Medium/1-twoSum.js)
67+
*[2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) -[Solution](./Medium/2-addTwoNumbers.js)
6768
*[3. Longest Substring Without Repeating Characters](https://oj.leetcode.com/problems/longest-substring-without-repeating-characters/) -[Solution](./Medium/3-lengthOfLongestSubstring.js)
6869
*[11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/) -[Solution](./Medium/11-containerMostWater.js)
6970
*[15. 3Sum](https://leetcode.com/problems/3sum/) -[Solution](./Medium/15-3sum.js)

0 commit comments

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