線性搜索數組字符串

Question

我需要在我的數組中找到一個字符串元素，但是當我查看時，它總是以發現的方式出現，即使它不是這種情況。我正在嘗試調用一種方法。

String name = ""; 
    boolean result = false; 




    if (option == 5) 
      { 
     System.out.println("Please enter a students name"); 
     name = input.next(); 

     linearSearch(student); 


     if (result = true) 
     {System.out.println(name+" found in element ");} 

     else 
     {System.out.println(name+" not found in element ");} 


    } 


public static boolean linearSearch(String b[]) 
{ 
String key = null; 
boolean searchReturn = false; 
for(int i = 0; i < b.length; i++) 
{ 
    //if key is found - return position of key i.e. n 
    if(b[i] == key) 
    searchReturn = true; 
} 

return searchReturn; 

Answer 1

首先你應該叫if(result == true){} //you performing a assignment.

Answer 2

字符串平等應該String.equals（STR）的方法進行檢查。

嘗試

for(int i = 0; i < b.length; i++) 
    { 
     //if key is found - return position of key i.e. n 
     if(b[i].equals(name)) 
     searchReturn = true; 
    }