import java.util.TreeMap;
public class IFailAtJava {
public static void main(String[] args) {
}
public String[] unique(String[] s) {
String[] word = s;
TreeMap<String, Integer> map...
Type: Posts; User: btw2292
import java.util.TreeMap;
public class IFailAtJava {
public static void main(String[] args) {
}
public String[] unique(String[] s) {
String[] word = s;
TreeMap<String, Integer> map...
import java.util.TreeMap;
public class IFailAtJava {
public static void main(String[] args){
}
public void unique(String[] s){
String[] word = s;
TreeMap<String, Integer> map =...
Thank you for the input, however, I am still unsure as to what the actual code for this would look like. Can anyone provide some code for me?
How can I create a method that uses a HashSet and will return the unique characters in a string?
for example
unique("racecar") ----> "e"
unique("confuse") ----> "confuse"
Thank you.