diff --git a/lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java b/lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java index 248938a96..167c3e0c0 100644 --- a/lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java +++ b/lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java @@ -1,5 +1,6 @@ package com.codedifferently.lesson11; +import java.util.ArrayList; import java.util.List; public class Lesson11 { @@ -9,7 +10,14 @@ public class Lesson11 { * https://leetcode.com/problems/concatenation-of-array */ public int[] getConcatenation(int[] nums) { - return null; + int n = nums.length; + int[] ans = new int[2 * n]; + + for (int i = 0; i < nums.length; i++) { + ans[i] = nums[i]; + ans[i + n] = nums[i]; + } + return ans; } /** @@ -17,6 +25,13 @@ public int[] getConcatenation(int[] nums) { * https://leetcode.com/problems/find-words-containing-character/ */ public List findWordsContaining(String[] words, char x) { - return null; + List indices = new ArrayList<>(); + + for (int i = 0; i < words.length; i++) { + if (words[i].indexOf(x) != -1) { + indices.add(i); + } + } + return indices; } } diff --git a/lesson_11/arrays_ts/src/lesson11.ts b/lesson_11/arrays_ts/src/lesson11.ts index 54af1ba03..0a9d9afb4 100644 --- a/lesson_11/arrays_ts/src/lesson11.ts +++ b/lesson_11/arrays_ts/src/lesson11.ts @@ -3,7 +3,14 @@ * https://leetcode.com/problems/concatenation-of-array */ export function getConcatenation(nums: number[]): number[] { - return []; + const n = nums.length; + const ans: number[] = new Array(2 * n); + + for (let i = 0; i < n; i++) { + ans[i] = nums[i]; + ans[i + n] = nums[i]; + } + return ans; } /** @@ -11,5 +18,12 @@ export function getConcatenation(nums: number[]): number[] { * https://leetcode.com/problems/find-words-containing-character/ */ export function findWordsContaining(words: string[], x: string): number[] { - return []; + const indices: number[] = []; + + for (let i = 0; i < words.length; i++) { + if (words[i].includes(x)) { + indices.push(i); + } + } + return indices; }