v.get(i).equals(zeichenkette)char[] zeichenkette - also ein charArray!public boolean compare(char[] c1, char[] c2){
String s1 = new String(c1);
String s2 = new String(c2);
return s1.equals(s2);
}
und dann so danach suchen:
for(char[] c : v){
if(compare(c, zeichenKette)){
//gefunden
}
}char[]Gast hat gesagt.:
int vorkommen = 0;
for (int i = 0; i < v.size(); i++)
{
if(v.get(i).equals(zeichenkette))
{
vorkommen ++;
}
}
}
return vorkommen; /**
* Compares this string to the specified object.
* The result is <code>true</code> if and only if the argument is not
* <code>null</code> and is a <code>String</code> object that represents
* the same sequence of characters as this object.
*
* @param anObject the object to compare this <code>String</code>
* against.
* @return <code>true</code> if the <code>String </code>are equal;
* <code>false</code> otherwise.
* @see java.lang.String#compareTo(java.lang.String)
* @see java.lang.String#equalsIgnoreCase(java.lang.String)
*/
public boolean equals(Object anObject) {
if (this == anObject) {
return true;
}
if (anObject instanceof String) {
String anotherString = (String)anObject;
int n = count;
if (n == anotherString.count) {
char v1[] = value;
char v2[] = anotherString.value;
int i = offset;
int j = anotherString.offset;
while (n-- != 0) {
if (v1[i++] != v2[j++])
return false;
}
return true;
}
}
return false;
}
