🔒 Closed Java Program (CODECHUM)

[ShinigamiNel]

Pa help naman po dito mga sir. Nakahanap na ako ng code sa google tapos tini-tweak ko na lang para dun sa task. Anagram program po siya pero if may "?" sa input, pwedeng maging anagram pa rin basta pareho yung ibang letters
Example:
cat
dog
Output: false

nose
se?n
Output: anagram

?
a
Output: anagram

Ito po yung code tapos yung dulong part ang ginagawa ko di ko alam kung tama ba siya
↓
package packagename;



import java.util.Arrays;
import java.util.Scanner;

class mainclassname
{
public static void main(String[] args)
{
Scanner scanner = new Scanner(System.in);

// Getting the input string from the user

String s1 = scanner.nextLine();

String s2 = scanner.nextLine();

if(checkAnagram(s1, s2))
System.out.println("anagram");
else
System.out.println("false");

scanner.close();
}

public static boolean checkAnagram(String s1, String s2)
{
// Remove all the white space
s1 = s1.replaceAll("\\s", "");
s2 = s2.replaceAll("\\s", "");

// Check if both length matches
if(s1.length() != s2.length())
return false;
else
{

int length=s1.length();
// Convert both Strings into lower case and into Character Array
char[] arr1 = s1.toLowerCase().toCharArray();
char[] arr2 = s2.toLowerCase().toCharArray();

// Sort both Character Array
Arrays.sort(arr1);
Arrays.sort(arr2);

int count=0;
for(int i=0; i<length; i++){
if(arr1==arr2 || arr1=='?'){
count++;
if(count==length){
break;
}
}

}
return true;
}
}
}

 

[R3g4z4k1]

feedback ?

 

[Marouzxc]

Excuse me po. Na solve niyo na po ba yung test xase? Pwede po ba makahingi ng code. Same error lang din po sa akin di namimeet ng code ko yung lahat ng test case.

 

[ShinigamiNel]

Actually nanghingi na lang din ako ng tulong sa coding god kong kaklase eh di talaga kinaya ng utak ko HAHAHAHA

Anyway, ito yung additional na code na nakapag pa-ayos dun sa program. Di ko lang makita yung full code kasi napasa na eh.
↓


for(int i=0; i<length; i++){
if(arr1=='?'||arr2=='?')
count++;
else {
for(int j=0;j<length;j++) {
if(arr2[j]=='?') {
count++;
break;
}
if(arr1==arr2[j]) {
count++;
break;
}
}
}