-
Notifications
You must be signed in to change notification settings - Fork 94
Java Derusting Practice #18
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
Open
arcjun01
wants to merge
7
commits into
auberonedu:main
Choose a base branch
from
arcjun01:main
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
7 commits
Select commit
Hold shift + click to select a range
af0706c
Followed the prompt and added code to complete this task.
arcjun01 e12ae47
Completed ListPractice and added refresher in toRefresh.md
arcjun01 aa7f104
Completed NumberPractice and modified toRefresh.md file.
arcjun01 4d8ee81
Completed StringPractice and added resources in toRefresh.md
arcjun01 88cc7d1
Completed SetPractice and added few notes in toRefresh.md
arcjun01 676b769
Completed MapPractice exercise and added a link that guided me to sol…
arcjun01 9486166
Completed Person.java exercise and added a resource for review in toR…
arcjun01 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
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
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
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
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
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
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,17 +1,34 @@ | ||
|
|
||
| import java.util.HashSet; | ||
|
|
||
| public class SetPractice { | ||
| public static void main(String[] args) { | ||
| // Create a HashSet of Strings and assign it to a variable of type Set | ||
| HashSet<String> wordSet = new HashSet<>(); | ||
|
Owner
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. Remember to use interface types (Set) |
||
|
|
||
| // Add 3 elements to the set | ||
| // (It's OK to do it one-by-one) | ||
| wordSet.add("Good"); | ||
| wordSet.add("Morning"); | ||
| wordSet.add("Everyone"); | ||
|
|
||
| // Check whether the Set contains a given String | ||
| String checkString = "Hello"; | ||
| boolean contains = wordSet.contains(checkString); | ||
| System.out.println("Does this set contains the word " + " '" + checkString + "'? " + contains); | ||
|
|
||
| // Remove an element from the Set | ||
| wordSet.remove("Good"); | ||
|
|
||
| // Get the size of the Set | ||
| int size = wordSet.size(); | ||
| System.out.println("Size of Set: " + size); | ||
|
|
||
| // Iterate over the elements of the Set, printing each one on a separate line | ||
| System.out.println("Here are the elements in the set:"); | ||
| for (String word : wordSet) { | ||
| System.out.println(word); | ||
| } | ||
|
|
||
| /* | ||
| * Warning! | ||
|
|
||
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,25 +1,51 @@ | ||
|
|
||
| import java.util.ArrayList; | ||
|
|
||
| public class StringPractice { | ||
| public static void main(String[] args) { | ||
| // Create a string with at least 5 characters and assign it to a variable | ||
| String word = "Computer"; | ||
|
|
||
| // Find the length of the string | ||
| int length = word.length(); | ||
| System.out.println("Length of this word is: " + length); | ||
|
|
||
| // Concatenate (add) two strings together and reassign the result | ||
| String word2 = "Table"; | ||
| String addedWord = word + word2; | ||
| System.out.println("Concatenated Strings: " + addedWord); | ||
|
|
||
| // Find the value of the character at index 3 | ||
| char findChar = word.charAt(3); | ||
| System.out.println("Character at index 3 is: " + findChar); | ||
|
|
||
| // Check whether the string contains a given substring (i.e. does the string have "abc" in it?) | ||
| boolean containsSubsting = word.contains("abc"); | ||
| System.out.println("Does it contain 'abc'? " + containsSubsting); //false | ||
|
|
||
| // Iterate over the characters of the string, printing each one on a separate line | ||
| System.out.println("-- Prints each letter in every line -- "); | ||
| for (int i = 0; i < word.length(); i++) { | ||
| System.out.println(word.charAt(i)); | ||
| } | ||
|
|
||
| // Create an ArrayList of Strings and assign it to a variable | ||
| ArrayList<String> strList = new ArrayList<>(); | ||
|
Owner
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. Remember to use interface types (List) |
||
|
|
||
| // Add multiple strings to the List (OK to do one-by-one) | ||
| strList.add("Camera"); | ||
| strList.add("Pen"); | ||
| strList.add("Book"); | ||
|
|
||
| // Join all of the strings in the list together into a single string separated by commas | ||
| // Use a built-in method to achieve this instead of using a loop | ||
| String allStrings = String.join(", ", strList); | ||
| System.out.println("Joined string: " + allStrings); | ||
|
|
||
| // Check whether two strings are equal | ||
| String word3 = "Paper"; | ||
| boolean areEqual = word.equals(word3); | ||
| System.out.println("Are they equal? " + areEqual); | ||
|
|
||
| /* | ||
| * Reminder! | ||
|
|
||
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
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.
Remember to use interface types (Map)