Skip to content
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -1,22 +1,36 @@
package com.codedifferently.lesson11;

import java.util.ArrayList;
import java.util.List;

public class Lesson11 {

/**
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Could keep the function comments and the notes from below.

* Provide the solution to LeetCode 1929 here:
* https://leetcode.com/problems/concatenation-of-array
*/
public int[] getConcatenation(int[] nums) {
return null;
int n = nums.length;
int[] results = new int[2 * n];
for (int i = 0; i < n; i++) {
results[i] = nums[i];
results[i + n] = nums[i];
}
return results;
}

// lookiing for an integer array that has a concatenation method Im going to given the paramters
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

These comments shouldn't be here.

// of integer array of variable named nums
// We are declaring one of the variable which is n which equals num.length.

/**
* Provide the solution to LeetCode 2942 here:
* https://leetcode.com/problems/find-words-containing-character/
*/
public List<Integer> findWordsContaining(String[] words, char x) {
return null;
List<Integer> indices = new ArrayList<>();
// The new array lists is the result of the place of the indices
for (int i = 0; i < words.length; i++) {
if (words[i].indexOf(x) != -1) {
indices.add(i);
}
}
return indices;
}
}