给定一个整数，并允许将其删除n个数字，使得值最小，例：data:178593, 删除一个数字，result:17593

import java.util.Scanner;
import java.util.*;
import java.util.Iterator;
public class Smile {
	/*
	 * 最近正好在复习数据结构，深入java常用集合．
	 * 将其应用于实际
	 * 存在既有价值，各有优缺点，针对不同的环境应用合适的实现策略．
	 * ArrayList优点：查询
	 * ListList优点：插入，删除
	 * */	
	public static void main(String[] args) {
		/*输入数据*/
		Scanner in = new Scanner(System.in);
		int data = in.nextInt();
		int count = in.nextInt();

		/*将数据拆分成单个数字，暂存ArrayList*/
		ArrayList<Integer> list = new ArrayList<Integer>();	
		while (data != 0) {
			list.add(data%10);
			data /= 10;
		}

		/*将拆分的数据导入LinkedList,在接下来的操作中进行删除*/
		LinkedList<Integer> linkedList = new LinkedList<Integer>();
		for (int i = list.size() - 1; i >= 0; i--) {
			linkedList.add(list.get(i));
		}

		/*Iterator遍历*/
		Iterator llItr = linkedList.iterator();
		while(llItr.hasNext()) {
			System.out.print(llItr.next());
		}
		
		/*逻辑处理, 方法挺笨的，纯暴力*/
		while (count > 0) {
			int length = linkedList.size() - 1;
			for (int i = 0; i <= length; i++) {
				int value = linkedList.get(i);
				if (value > linkedList.get(i+1)) {
					linkedList.remove(i);
					count--;
					break;
				}

				if (i == length) {
					linkedList.remove(length);
					count--;
				}
			}
		}

		/*最终结果:*/
		System.out.println();
		llItr = linkedList.iterator();
		while(llItr.hasNext()) {
			System.out.print(llItr.next());
		}
		

	}
}