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..d4eb8a1c7 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,22 +1,27 @@ package com.codedifferently.lesson11; +import java.util.ArrayList; import java.util.List; public class Lesson11 { - /** - * Provide the solution to LeetCode 1929 here: - * https://leetcode.com/problems/concatenation-of-array - */ public int[] getConcatenation(int[] nums) { - return null; + int[] answer = new int[2 * nums.length]; + + for (int i = 0; i < nums.length; i++) { + answer[i] = nums[i]; + answer[i + nums.length] = nums[i]; + } + return answer; } - /** - * Provide the solution to LeetCode 2942 here: - * https://leetcode.com/problems/find-words-containing-character/ - */ public List findWordsContaining(String[] words, char x) { - return null; + List answer = new ArrayList(); + for (int i = 0; i < words.length; i++) { + if (words[i].indexOf(x) != -1) { + answer.add(i); + } + } + return answer; } } diff --git a/lesson_11/arrays_ts/src/lesson11.ts b/lesson_11/arrays_ts/src/lesson11.ts index 54af1ba03..ab3a367a6 100644 --- a/lesson_11/arrays_ts/src/lesson11.ts +++ b/lesson_11/arrays_ts/src/lesson11.ts @@ -1,15 +1,20 @@ -/** - * Provide the solution to LeetCode 1929 here: - * https://leetcode.com/problems/concatenation-of-array - */ + export function getConcatenation(nums: number[]): number[] { - return []; + const answer = new Array(2*nums.length); + + for (let i=0;i