一堆字符串进行排序

写着完,顺便记录下:

package com.techbirds.util;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class StringCompareUtils {
	
	final static String[] str={"1sadsad","123aa","DSDF","dadf","asd","fdsa","asdf","fdsa","qwe1","123a","d1"};
	static List<String> arrs=new ArrayList<String>();
	static{
		arrs=Arrays.asList(str);
	}
	
	/**
	 * 考虑大小写
	 * 排序结果:[123a, 123aa, 1sadsad, DSDF, asd, asdf, d1, dadf, fdsa, fdsa, qwe1]
	 * @param str1
	 * @param str2
	 * @return
	 */
	public static boolean compareStrSumOnCase(final String str1,final String str2){
		return getSumByStr(str1)>getSumByStr(str2);
	}
	
	
	/**
	 * 考虑大小写
	 * 排序结果:xxxx
	 * @param str1
	 * @param str2
	 * @param index
	 * @return
	 */
	public static boolean compareStrOnCase(final String str1,final String str2,final int index){
		boolean flag=false;
		//说明str1的索引越界
		if(index>=str1.length()){
			return false;
		}
		//说明str2的索引越界
		if(index>=str2.length()){
			return true;
		}
		if(str1.charAt(index)>str2.charAt(index)){
			flag=true;
		}else if(str1.charAt(index)==str2.charAt(index)) {
			flag=compareStrOnCase(str1, str2, index+1);
		}
		return flag;
	}
	
	
	/**
	 * 计算得到字符串代表整数值,考虑大小写
	 * 例如:"ac",a=97 c=99
	 * 		  ac=97*10+99
	 * 
	 * @param str
	 * @return
	 */
	public static int getSumByStr(final String str){
		int sum=0;
		final int size=str.length();
		for (int i = str.length(); i >0; i--) {
			if(i-1==0){
				sum+=str.charAt(size-i);
			}else{
				sum+=str.charAt(size-i)*10*(i-1);
			}
		}
		return sum;
	}
	
	public static void main(String[] args) {
		
		for (int i = 0; i < arrs.size(); i++) {
			for (int j = i+1; j < arrs.size(); j++) {
				if(compareStrOnCase(arrs.get(i), arrs.get(j),0)){
					String tempStr=arrs.get(j);
					arrs.set(j, arrs.get(i));
					arrs.set(i, tempStr);
				}
			}
		}
		System.out.println(compareStrOnCase("123a", "d1", 0));
	}
	
	
}


  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
首先,需要定义一个二叉堆类,包含堆的初始化、插入、删除等方法。然后,将字符串数组插入到堆中,最后依次从堆中删除元素,即可得到排序后的字符串数组。 以下是一个示例代码: ```java public class BinaryHeap { private String[] heapArray; private int maxSize; private int currentSize; public BinaryHeap(int maxSize) { this.maxSize = maxSize; this.currentSize = 0; this.heapArray = new String[maxSize]; } public boolean isEmpty() { return currentSize == 0; } public boolean insert(String value) { if (currentSize == maxSize) { return false; } heapArray[currentSize] = value; trickleUp(currentSize++); return true; } public String remove() { String root = heapArray[0]; heapArray[0] = heapArray[--currentSize]; trickleDown(0); return root; } private void trickleUp(int index) { int parent = (index - 1) / 2; String bottom = heapArray[index]; while (index > 0 && heapArray[parent].compareTo(bottom) < 0) { heapArray[index] = heapArray[parent]; index = parent; parent = (parent - 1) / 2; } heapArray[index] = bottom; } private void trickleDown(int index) { int largerChild; String top = heapArray[index]; while (index < currentSize / 2) { int leftChild = 2 * index + 1; int rightChild = leftChild + 1; if (rightChild < currentSize && heapArray[leftChild].compareTo(heapArray[rightChild]) < 0) { largerChild = rightChild; } else { largerChild = leftChild; } if (top.compareTo(heapArray[largerChild]) >= 0) { break; } heapArray[index] = heapArray[largerChild]; index = largerChild; } heapArray[index] = top; } } public class HeapSort { public static void main(String[] args) { String[] array = {"apple", "banana", "orange", "pear", "peach"}; BinaryHeap heap = new BinaryHeap(array.length); for (String s : array) { heap.insert(s); } for (int i = 0; i < array.length; i++) { array[i] = heap.remove(); } for (String s : array) { System.out.print(s + " "); } } } ``` 在这个示例中,我们首先创建了一个二叉堆类 `BinaryHeap`,包含堆的初始化、插入、删除等方法。然后,我们创建了一个字符串数组,并将其插入到堆中。最后,我们依次从堆中删除元素,并将其存储到原数组中,即可得到排序后的字符串数组。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值