线性搜索数组字符串

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; 
    }