program to check if input string is valid anagram #260
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,64 @@ | ||
| import java.util.HashMap; | ||
| import java.util.Map; | ||
|
|
||
| /** | ||
| * Created by Dungeoun on 10/2/16. | ||
| */ | ||
| public class Solution { | ||
|
|
||
| public static int longestPalindrome(String s) { | ||
|
|
||
|
|
||
| HashMap<Character, Integer> hash1 = new HashMap<>(); | ||
|
|
||
| int length =0; | ||
|
|
||
|
|
||
| for(int i = 0; i<s.length(); i++){ | ||
|
|
||
| if(hash1.containsKey(s.charAt(i))==false){ | ||
|
|
||
| hash1.put(s.charAt(i), 1); | ||
|
|
||
| } | ||
|
|
||
| else{ | ||
|
|
||
| hash1.put(s.charAt(i), hash1.get(s.charAt(i))+1); | ||
|
|
||
| } | ||
| } | ||
|
|
||
| for(Map.Entry<Character,Integer> entry: hash1.entrySet()){ | ||
|
|
||
| if(entry.getValue()%2 == 0){ | ||
|
|
||
| length = length + entry.getValue(); | ||
|
|
||
| } | ||
| else if(entry.getValue()%2 != 0){ | ||
|
|
||
| length = length + entry.getValue()-1; | ||
|
|
||
| } | ||
|
|
||
|
|
||
| } | ||
|
|
||
| if(s.length()>length) { | ||
|
|
||
| return length + 1; | ||
| } | ||
| else return length; | ||
|
|
||
| } | ||
|
|
||
|
|
||
| public static void main(String []args){ | ||
|
|
||
| int l = longestPalindrome("bb"); | ||
|
|
||
| System.out.println(l); | ||
|
|
||
| } | ||
| } |
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 |
|---|---|---|
| @@ -0,0 +1,89 @@ | ||
| import java.util.HashMap; | ||
| import java.util.Map; | ||
|
|
||
| /** | ||
| * Created by Dungeoun on 10/2/16. | ||
| */ | ||
|
|
||
|
|
||
|
|
||
| public class Solution { | ||
|
|
||
| public static boolean isAnagram(String s, String t) { | ||
|
|
||
|
There was a problem hiding this comment. Remove unnecessary empty lines. |
||
|
|
||
| HashMap<Character, Integer> hash1 = new HashMap<>(); | ||
|
|
||
| HashMap<Character, Integer> hash2 = new HashMap<>(); | ||
|
|
||
| boolean a = false; | ||
|
|
||
|
There was a problem hiding this comment. Put in some comments in your code. |
||
|
|
||
| for (int i = 0; i < s.length(); i++) { | ||
|
|
||
| if (hash1.containsKey(s.charAt(i)) == false) { | ||
|
There was a problem hiding this comment. Instead of |
||
|
|
||
| hash1.put(s.charAt(i), 1); | ||
|
|
||
| } else { | ||
|
|
||
| hash1.put(s.charAt(i), hash1.get(s.charAt(i)) + 1); | ||
|
|
||
| } | ||
|
|
||
| } | ||
|
|
||
| for (int i = 0; i < t.length(); i++) { | ||
|
|
||
| if (hash2.containsKey(t.charAt(i)) == false) { | ||
|
There was a problem hiding this comment. Instead of |
||
|
|
||
| hash2.put(t.charAt(i), 1); | ||
|
|
||
| } else { | ||
|
|
||
| hash2.put(t.charAt(i), hash2.get(t.charAt(i)) + 1); | ||
|
|
||
| } | ||
|
|
||
| } | ||
|
|
||
|
|
||
| if(hash1.size()!=hash2.size()){ | ||
| a = false; | ||
|
There was a problem hiding this comment. You can in this cases write |
||
| } | ||
|
|
||
| else if((hash1.size()==0 && hash2.size()==0) ) { | ||
| a = true; | ||
|
There was a problem hiding this comment. Same thing as above. |
||
| } | ||
| else if(hash1.size()!=hash2.size()){ | ||
|
There was a problem hiding this comment. unnecessary. You has check this condition above, too. |
||
| a = false; | ||
| } | ||
|
|
||
| else { | ||
| for (Map.Entry<Character, Integer> entry : hash1.entrySet()) { | ||
|
There was a problem hiding this comment. Instead of this monster. You can use |
||
|
|
||
|
|
||
| if (hash2.containsKey(entry.getKey()) == true && hash2.get(entry.getKey()) == entry.getValue()) { | ||
|
|
||
| a = true; | ||
|
|
||
| } | ||
| else { | ||
| a = false; | ||
| break; | ||
| } | ||
|
|
||
| } | ||
| } | ||
| return a; | ||
|
|
||
| } | ||
|
|
||
| public static void main( String []args){ | ||
|
|
||
| boolean b = isAnagram("a","ab"); | ||
|
There was a problem hiding this comment.
|
||
|
|
||
| System.out.println(b); | ||
|
|
||
| } | ||
| } |
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.
Please name your file according to the class name.