一.字符串分割
/** */
/**对字符串数组进行排序
* @param str 原始字符串数组
* @param flag flag=0:顺序排序 flag=1:倒序排序
* @return 排序后的字符串数组
*/

public
String[] sort(String[] str,
int
flag)
...
{
if(str==null||str.length==0)
throw new IllegalArgumentException();
String temp=str[0];
//顺序排列 ,即从小到大

if(flag==0)...{

for(int i=0;i<str.length-1;i++)...{

for(int j=i+1;j<str.length;j++)...{

if(str[i].compareTo(str[j])>0)...{
temp=str[i];
str[i]=str[j];
str[j]=temp;
}
}
}
}

else if(flag==1)...{//倒序排列

for(int i=0;i<str.length-1;i++)...{

for(int j=i+1;j<str.length;j++)...{

if(str[i].compareTo(str[j])<0)...{
temp=str[i];
str[i]=str[j];
str[j]=temp;
}
}
}
}
return str;
}
三.字符串的过滤
1.利用字符串类的split方法进行分割
/** */
/**利用字符串的split方法进行分割
* @param str 待分割的字符串
* @param sdelimiter 分割符
* @return
*/

public
String[] splitString(String str,String sdelimiter)
...
{
String[] array=str.split(sdelimiter);
return array;
}
2.利用StringTokenizer来进行字符串分割
/** */
/**利用StringTokenizer来进行字符串分割
* @param str 待分割的字符串
* @param sdelimiter 分割符
* @return
*/

public
String[] useStringTokenizer(String str,String sdelimiter)
...
{
StringTokenizer token=new StringTokenizer(str,sdelimiter);
String[] array=new String[token.countTokens()];
int i=0;

while(token.hasMoreTokens())...{
array[i]=token.nextToken();
i++;
}
return array;
}
二.字符串数组排序









































































删除一个字符串中重复的元素,比较两个字符串数组 中不同的元素等可以参看本人另一篇文章:
public
String[] checkArray(String[] str)
...
{
Hashtable<String, String> hash=new Hashtable<String, String>();


for(int i=0;i<str.length;i++)...{
if(!hash.containsKey(str[i]))
hash.put(str[i], str[i]);
}

Enumeration enumeration=hash.keys();
String[] str_new=new String[hash.size()];
int i=0;


while(enumeration.hasMoreElements())...{
str_new[i]=enumeration.nextElement().toString();
i++;
}
return str_new;
}
示例:
String[] mobile={"13811071500","13811071500","13811071501","13811071503","13811071501"};
mobile=checkArray(mobile);
for(int i=0;i<mobile.length;i++)
System.out.println(mobile[i]);
输出结果为:
13811071503
13811071501
13811071500
2.A,B均为字符串数组,找出在A中存在,而在B中不存在的字符串
public String[] compareArray(String[] A,String[] B){
Hashtable<String, String> hash=new Hashtable<String, String>();
Hashtable<String, String> hash_new=new Hashtable<String, String>();
for(int i=0;i<B.length;i++)
hash.put(B[i], B[i]);
for(int i=0;i<A.length;i++){
if(!hash.containsKey(A[i]))
hash_new.put(A[i], A[i]);
}
String[] C=new String[hash_new.size()];
int i=0;
Enumeration enumeration=hash_new.keys();
while(enumeration.hasMoreElements()){
C[i]=enumeration.nextElement().toString();
i++;
}
return C;
}
示例:
String[] mobile1={"13811071500","13811071501","13811071502","13811071503","13811071504"};
String[] mobile2={"13811071500","13811071505","13811071502","13811071506","13811071504"};
String[] mobile3=compareArray(mobile1,mobile2);
for(int i=0;i<mobile3.length;i++)
System.out.println(mobile[i]);
输出结果:
13811071503
13811071501
存在的问题:
每次都是倒序,可以再对程序稍加改动,变成正序。
/** */
/**检验一个字符串数组,若包含某一特定的字符串,则将该字符串从数组中删
除,返回剩余的字符串数组
* @param str_array 字符串数组
* @param str_remove 待删除的字符串
* @return 过滤后的字符串
*/
public
String[] removeStrFromArray(String[] str_array,String

str_remove)
...
{
Hashtable<String, String> hash=new Hashtable<String, String>();

for(int i=0;i<str_array.length;i++)...{
if(!str_array[i].equals(str_remove))
hash.put(str_array[i], str_array[i]);
}
//生成一个新的数组
String[] str_new=new String[hash.size()];
int i=0;
Enumeration enumeration=hash.keys();

while(enumeration.hasMoreElements())...{
str_new[i]=enumeration.nextElement().toString();
i++;
}
return str_new;
}
1.在一些字符串数组中,常会有重复的记录,比如手机号码,我们可以通过Hashtable来对其进行过滤





















示例:
String[] mobile={"13811071500","13811071500","13811071501","13811071503","13811071501"};
mobile=checkArray(mobile);
for(int i=0;i<mobile.length;i++)
System.out.println(mobile[i]);
输出结果为:
13811071503
13811071501
13811071500
2.A,B均为字符串数组,找出在A中存在,而在B中不存在的字符串
public String[] compareArray(String[] A,String[] B){
Hashtable<String, String> hash=new Hashtable<String, String>();
Hashtable<String, String> hash_new=new Hashtable<String, String>();
for(int i=0;i<B.length;i++)
hash.put(B[i], B[i]);
for(int i=0;i<A.length;i++){
if(!hash.containsKey(A[i]))
hash_new.put(A[i], A[i]);
}
String[] C=new String[hash_new.size()];
int i=0;
Enumeration enumeration=hash_new.keys();
while(enumeration.hasMoreElements()){
C[i]=enumeration.nextElement().toString();
i++;
}
return C;
}
示例:
String[] mobile1={"13811071500","13811071501","13811071502","13811071503","13811071504"};
String[] mobile2={"13811071500","13811071505","13811071502","13811071506","13811071504"};
String[] mobile3=compareArray(mobile1,mobile2);
for(int i=0;i<mobile3.length;i++)
System.out.println(mobile[i]);
输出结果:
13811071503
13811071501
存在的问题:
每次都是倒序,可以再对程序稍加改动,变成正序。
3.将一个字符串数组中某一个特定的字符串过滤掉



























