Skip to content

Commit a93f230

Browse files
committed
Merge remote-tracking branch 'origin/master'
# Conflicts: # README.md # src/_728/Solution.js # tips/1/README.md
2 parents bc82983 + ebf4999 commit a93f230

File tree

2 files changed

+46
-2
lines changed

2 files changed

+46
-2
lines changed

src/_1/Solution.js

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
/**
2+
* @param {number[]} nums
3+
* @param {number} target
4+
* @return {number[]}
5+
*/
6+
var twoSum = function(nums, target) {
7+
for (let i = 0; i < nums.length - 1; i++) {
8+
res = target - nums[i]
9+
for (let j = i + 1; j < nums.length; j++) {
10+
if (nums[j] === res) {
11+
return [i, j]
12+
}
13+
}
14+
if (i === nums.length) {
15+
return []
16+
}
17+
}
18+
}

tips/728/README.md

Lines changed: 28 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@ The boundaries of each input argument are 1 <= left <= right <= 10000.
2626

2727
### 打表(Java)
2828

29-
```
29+
```Java
3030
int sum = 0;
3131
for (int i = left; i < right; i++) {
3232
int num = i;
@@ -46,4 +46,30 @@ for (int i = left; i < right; i++) {
4646
sum++;
4747
}
4848
}
49-
```
49+
```
50+
51+
### JavaScript
52+
```JavaScript
53+
var selfDividingNumbers = function(left, right) {
54+
var result = []
55+
for (var i = left; i <= right; i++ ) {
56+
if (i < 10) {
57+
result.push(i)
58+
} else {
59+
if (/0/.test(i.toString())) {
60+
i = i + 1
61+
}
62+
for (var j = 0; j < i.toString().length; j++) {
63+
if (i % Number(i.toString().split('')[j]) !== 0) {
64+
break
65+
}
66+
if (i % Number(i.toString().split('')[j]) === 0 && j === i.toString().length - 1) {
67+
console.log(i);
68+
result.push(i)
69+
}
70+
}
71+
}
72+
}
73+
return result
74+
};
75+
```

0 commit comments

Comments
 (0)