File tree Expand file tree Collapse file tree 2 files changed +46
-2
lines changed Expand file tree Collapse file tree 2 files changed +46
-2
lines changed Original file line number Diff line number Diff line change
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
+ }
Original file line number Diff line number Diff line change @@ -26,7 +26,7 @@ The boundaries of each input argument are 1 <= left <= right <= 10000.
26
26
27
27
### 打表(Java)
28
28
29
- ```
29
+ ``` Java
30
30
int sum = 0 ;
31
31
for (int i = left; i < right; i++ ) {
32
32
int num = i;
@@ -46,4 +46,30 @@ for (int i = left; i < right; i++) {
46
46
sum++ ;
47
47
}
48
48
}
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
+ ```
You can’t perform that action at this time.
0 commit comments