我用Java解决了它。有一个自定义比较，它查看每个值的最大和最小索引，并对其进行排序。然后我把它们打印到屏幕上。

注意我的数据是在HashMap中，原因没有在这里解释，但它可以很容易地在一个简单的列表中。请注意我没有经验的编码实践。

@ Doug-Glancy如果你能用VB做的那就太棒了！

ValueComparator.java

import java.util.Comparator;

import java.util.Map;

public class ValueComparator implements Comparator {

private Map base;

public ValueComparator(Map m) {

this.base = m;

}

public int compare(String so1, String so2) {

// get the max and min indices from each data peice

Integer[] o1 = base.get(so1);

Integer[] o2 = base.get(so2);

// compare their min index first

if (o1[0] < o2[0]) {

return -1;

}

if (o1[0] == o2[0]) { //if they are the same

if ( o1[1] < o2[1]) { // then look at the max index

return -1;

}

else {

return 1;

}

}

else {

return 1;

}

}

}App.java

import java.util.ArrayList;

import java.util.Collections;

import java.util.HashMap;

import java.util.LinkedHashMap;

import java.util.LinkedList;

import java.util.List;

import java.util.Map;

import localhost.ValueComparator;

public class App

{

public static void main( String[] args )

{

// create a list to store our original data

ArrayList> keyValuePairs = new ArrayList>();

// add the data to the list

HashMap a = new LinkedHashMap();

a.put("a", "1"); a.put("b", "1"); a.put("c", "1"); a.put("d", "1"); a.put("f", "1"); a.put("g", "1"); a.put("h", "1"); a.put("i", "1"); a.put("j", "1");

keyValuePairs.add(a);

HashMap e = new LinkedHashMap();

e.put("a", "1"); e.put("b", "1"); e.put("d", "1"); e.put("e", "1"); e.put("f", "1"); e.put("h", "1"); e.put("i", "1"); e.put("j", "1");

keyValuePairs.add(e);

HashMap b = new LinkedHashMap();

b.put("a", "1"); b.put("b", "1"); b.put("c", "1"); b.put("d", "1"); b.put("e", "1"); b.put("f", "1"); b.put("j", "1"); b.put("k", "1"); b.put("l", "1");

keyValuePairs.add(b);

HashMap c = new LinkedHashMap();

c.put("a", "1"); c.put("b", "1"); c.put("x", "1"); c.put("d", "1"); c.put("e", "1"); c.put("f", "1"); c.put("g", "1"); c.put("h", "1"); c.put("m", "1");

keyValuePairs.add(c);

// create a map to store the max and min indices

Map m = new HashMap();

Integer curpos = new Integer(0);

// loop through the data and find the max and min indices of each data (key)

for ( Map s : keyValuePairs) {

curpos = 0;

for ( String t : s.keySet() ) {

if ( !m.containsKey(t) ){

// if its the first time to see the data, just add its current index as max and min

m.put(t,new Integer[] {curpos, curpos});

}

else {

// check if index is lower than existing minimum

Integer[] i = m.get(t);

if ( i[0] > curpos) {

m.put(t, new Integer[] {curpos, i[1]});

}

//check if index is greater than current maximum

if ( curpos > i[1] ) {

m.put(t, new Integer[] {i[0], curpos});

}

}

curpos++;

}

}

System.out.println("The unsorted data");

for ( HashMap h : keyValuePairs ) {

for ( String s : h.keySet() ) {

System.out.print(" " + s + " ");

}

System.out.println();

}

System.out.println("\n");

// Sort the data using our custom comparator

ValueComparator com = new ValueComparator(m);

List toSort = new LinkedList(m.keySet());

Collections.sort(toSort, com);

System.out.println("The sorted data");

for ( HashMap h : keyValuePairs) {

for ( String s : toSort ) {

if ( h.containsKey(s) ) {

System.out.print(s + " ");

}

else {

System.out.print(" ");

}

}

System.out.println();

}

}

}

letter                   ->

LadderScore0                   ->

LadderScore1                   ->

LadderScore2                   ->

LadderScore3                   ->

LadderScore4                   ->

LadderScore5                   ->

LadderScore6                   ->

LadderScore7                   ->

LadderScore8                   ->

LadderScore9                   ->

WeeklyDoneCount0                   ->

WeeklyDoneCount1                   ->

WeeklyDoneCount2                   ->

WeeklyDoneCount3                   ->

WeeklyDoneCount4                   ->

WeeklyDoneCount5                   ->

WeeklyDoneCount6                   ->

WeeklyDoneCount7                   ->

WeeklyDoneCount8                   ->

WeeklyDoneCount9                   ->

LastFPS0                   ->

LastFPS1                   ->

LastFPS2                   ->

LastFPS3                   ->

LastFPS4                   ->

LastFPS5                   ->

LastFPS6                   ->

LastFPS7                   ->

LastFPS8                   ->

LastFPS9                   ->

脚本内容如下#!/usr/bin/env python

#coding:utf-8

import os

format = '%-*s%-*s\n'

file = open('a.txt','r')

f = open('file.txt','a')

all = ""

for i in file:

i=i.split(' ')

a = format % (20, i[0], 20, '->')

all += a

f.write(a)

f.close()

file.close()

print all

文件展示