Here you can find the source of longestCommonPrefix(CharSequence str1, CharSequence str2)
public static final int longestCommonPrefix(CharSequence str1, CharSequence str2)
//package com.java2s; /**/*from w w w . jav a 2 s. com*/ * File: $HeadURL: https://hdt-java.googlecode.com/svn/trunk/hdt-java/src/org/rdfhdt/hdt/util/string/ByteStringUtil.java $ * Revision: $Rev: 199 $ * Last modified: $Date: 2013-04-17 23:35:53 +0100 (mi, 17 abr 2013) $ * Last modified by: $Author: mario.arias $ * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * Contacting the authors: * Mario Arias: mario.arias@deri.org * Javier D. Fernandez: jfergar@infor.uva.es * Miguel A. Martinez-Prieto: migumar2@infor.uva.es */ public class Main { public static final int longestCommonPrefix(CharSequence str1, CharSequence str2) { return longestCommonPrefix(str1, str2, 0); } public static final int longestCommonPrefix(CharSequence str1, CharSequence str2, int from) { int len = Math.min(str1.length(), str2.length()); int delta = from; while (delta < len && str1.charAt(delta) == str2.charAt(delta)) { delta++; } return delta - from; } }