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

Commit d17467a

Browse files
Merge pull request #32 from limbowandering/master
add javascript solutions
2 parents 4a8e17a + a525ec3 commit d17467a

File tree

3 files changed

+37
-0
lines changed

3 files changed

+37
-0
lines changed

‎solution/001.Two Sum/Solution.js‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
const twoSum = function(nums, target) {
2+
const map = {};
3+
4+
for (let i = 0; i < nums.length; i++) {
5+
if (map[nums[i]] !== undefined) {
6+
return [map[nums[i]], i]
7+
} else {
8+
map[target - nums[i]] = i
9+
}
10+
}
11+
};
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
const reverse1 = function(x){
2+
let s = String(x);
3+
let isNegative = false;
4+
if(s[0] === '-'){
5+
isNegative = true;
6+
}
7+
s = parseInt(s.split('').reverse().join(''));
8+
return isNegative ? (s > Math.pow(2,31) ? 0 : -s) : (s > Math.pow(2,31) - 1 ? 0 : s);
9+
}
10+
11+
const reverse = function(x){
12+
let result = parseInt(x.toString().split('').reverse().join(''));
13+
if(result > Math.pow(2,31) - 1 || -result < Math.pow(-2,31)) return 0;
14+
return x > 0 ? result: -result;
15+
}
Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
const longestCommonPrefix = function(strs){
2+
if(strs.length === 0) return '';
3+
for(let j = 0; j < strs[0].length; j++){
4+
for(let i = 0; i < strs.length; i++){
5+
if(strs[0][j] !== strs[i][j]){
6+
return strs[0].substring(0,j);
7+
}
8+
}
9+
}
10+
return strs[0];
11+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /