Commit d44ba0a

author

linjiajian999

committed

Array: 509, 686, 905, 977, 1002

1 parent 65691a8 commit d44ba0aCopy full SHA for d44ba0a

File tree

+120

-0

lines changed

+120

-0

lines changed

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+//https://leetcode.com/problems/find-common-characters/`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * @param {string[]} A`
	`5`	`+ * @return {string[]}`
	`6`	`+ */`
	`7`	`+var commonChars = function(A) {`
	`8`	`+ let res = A[0].split('');`
	`9`	`+ for (let i = 1; i < A.length; i++) {`
	`10`	`+ const nextArr = A[i].split('');`
	`11`	`+ res = res.filter(a => {`
	`12`	`+ const index = nextArr.indexOf(a);`
	`13`	`+ if (index > -1) {`
	`14`	`+ nextArr.splice(index, 1);`
	`15`	`+ return true;`
	`16`	`+ }`
	`17`	`+ return false;`
	`18`	`+ })`
	`19`	`+ }`
	`20`	`+ return res;`
	`21`	`+};`

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,27 @@`
	`1`	`+// https://leetcode.com/problems/fibonacci-number/`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * @param {number} N`
	`5`	`+ * @return {number}`
	`6`	`+ */`
	`7`	`+const map = new Map();`
	`8`	`+map.set(0, 0);`
	`9`	`+map.set(1, 1);`
	`10`	`+var fib = function(N) {`
	`11`	`+ if (N < 2) {`
	`12`	`+ return N;`
	`13`	`+ }`
	`14`	`+ if (map.has(N)) {`
	`15`	`+ return map.get(N);`
	`16`	`+ }`
	`17`	`+ let i = 2;`
	`18`	`+ while (i <= N) {`
	`19`	`+ if (map.has(i)) {`
	`20`	`+ i++;`
	`21`	`+ continue;`
	`22`	`+ }`
	`23`	`+ map.set(i, map.get(i - 1) + map.get(i - 2));`
	`24`	`+ i++;`
	`25`	`+ }`
	`26`	`+ return map.get(N);`
	`27`	`+};`

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+// https://leetcode.com/problems/sort-array-by-parity/`
	`2`	`+/**`
	`3`	`+ * @param {number[]} A`
	`4`	`+ * @return {number[]}`
	`5`	`+ */`
	`6`	`+var sortArrayByParity = function(A) {`
	`7`	`+ let l = 0;`
	`8`	`+ let i = 0;`
	`9`	`+ let r = A.length - 1;`
	`10`	`+ const res = [];`
	`11`	`+`
	`12`	`+ while (i < A.length) {`
	`13`	`+ if (A[i] % 2 === 0) {`
	`14`	`+ res [l] = A[i];`
	`15`	`+ l++;`
	`16`	`+ } else {`
	`17`	`+ res[r] = A[i]`
	`18`	`+ r--;`
	`19`	`+ }`
	`20`	`+ i++`
	`21`	`+ }`
	`22`	`+ return res;`
	`23`	`+};`

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+/**`
	`2`	`+ * https://leetcode.com/problems/squares-of-a-sorted-array/`
	`3`	`+ * @param {number[]} A`
	`4`	`+ * @return {number[]}`
	`5`	`+ */`
	`6`	`+var sortedSquares1 = function(A) {`
	`7`	`+ return A.map(a => a * a).sort((a, b) => a - b);`
	`8`	`+};`
	`9`	`+`
	`10`	`+/**`
	`11`	`+ * @param {number[]} A`
	`12`	`+ * @return {number[]}`
	`13`	`+ */`
	`14`	`+var sortedSquares2 = function(A) {`
	`15`	`+ if (A[0] > -1) {`
	`16`	`+ for (let i = 0; i < A.length; i++) {`
	`17`	`+ A[i] = A[i] * A[i];`
	`18`	`+ }`
	`19`	`+ return A;`
	`20`	`+ }`
	`21`	`+ const res = [];`
	`22`	`+ let left = 0;`
	`23`	`+ let right = A.length - 1;`
	`24`	`+ let i = right;`
	`25`	`+ while (i > -1) {`
	`26`	`+ if (A[left] < 0 && Math.abs(A[left]) > A[right]) {`
	`27`	`+ res[i] = A[left] * A[left];`
	`28`	`+ left++;`
	`29`	`+ i--;`
	`30`	`+ continue;`
	`31`	`+ }`
	`32`	`+ res[i] = A[right] * A[right];`
	`33`	`+ right--;`
	`34`	`+ i--;`
	`35`	`+ }`
	`36`	`+ return res;`
	`37`	`+};`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+// https://leetcode.com/problems/repeated-string-match/description/`
	`2`	`+/**`
	`3`	`+ * 686. Repeated String Match`
	`4`	`+ * @param {string} A`
	`5`	`+ * @param {string} B`
	`6`	`+ * @return {number}`
	`7`	`+ */`
	`8`	`+var repeatedStringMatch = function(A, B) {`
	`9`	`+ let count = 1;`
	`10`	`+ let str = A;`
	`11`	`+ while ()`
	`12`	`+};`

Comments

(0)