-
Notifications
You must be signed in to change notification settings - Fork 23
feat: completes leet code lesson #403
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Closed
Closed
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
26 changes: 20 additions & 6 deletions
26
lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 { | ||
|
||
/** | ||
* 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 | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe 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; | ||
} | ||
} |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
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.