Skip to content

Commit a6a1a85

Browse files
committed
22w5: add 1929 js solution
1 parent b63cb04 commit a6a1a85

File tree

2 files changed

+4
-0
lines changed

2 files changed

+4
-0
lines changed

README.md

+1
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@
66

77
| # | Title | Solution | Difficulty |
88
|---| ----- | -------- | ---------- |
9+
|1929|[Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/) | [js](./algorithms/concatenationOfArray/Solution.js) |Easy|
910
|1464|[Maximum Product of Two Elements in An Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)| [java](./algorithms/maximumProductOfTwoElementsInAnArray/Solution.java) [java_dream](./algorithms/maximumProductOfTwoElementsInAnArray_Dream/maximumProductOfTwoElementsInAnArray_Dream.java)|Easy|
1011
|1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [java_dream](./algorithms/uniqueNumberOfOccurrences/uniqueNumberOfOccurrences.java)|Easy|
1112
|1179|[Reformat Department Table](https://leetcode.com/problems/reformat-department-table/)| [Mysql](./algorithms/reformatDepartmentTable/Solution.sql) |Easy|
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
var getConcatenation = function(nums) {
2+
return [...nums, ...nums];
3+
};

0 commit comments

Comments
 (0)