Smallest Substring

时间限制:10000ms

单点时限:1000ms

内存限制:256MB

描述

Given a string S and an integer K, your task is to find the lexicographically smallest string T which satisfies:

1. T is a subsequence of S

2. The length of T is K.

输入

The first line contain an integer K. (1 <= K <= 100000)

The second line contains a string of lowercase letters. The length of S is no more than 100000.

输出

The string T.

样例输入

4
cacbbac

样例输出

abac

package Daily;import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;public class Main_230 {public static void main(String [] args){Scanner scanner = new Scanner(System.in);int T = scanner.nextInt();String s = scanner.next();PriorityQueue<Node> queue = new PriorityQueue<>(Math.max(s.length() - T, 1), new Comparator<Node>() {@Overridepublic int compare(Node o1, Node o2) {if(o1.c == o2.c) return o1.index - o2.index;return o1.c - o2.c;//return 0;}public boolean equals(Object obj){return false;}});for(int i =0; i< s.length() -T ; i ++){queue.add(new Node(s.charAt(i) , i));}int ind = -1;int len = s.length() -T;while(T -- != 0){queue.add(new Node(s.charAt(len),len ++));Node node;do{node = queue.remove();}while(node.index <= ind);ind = node.index;System.out.println(node.c);}}static class Node{private  char c;private  int index;public Node(char c, int index){this.c = c;this.index = index;}}
}

Smallest Substring相关推荐

1198 Substring
Substring Time limit: 1 second(s) Memory limit: 32768 KBytes Total Submit : 1767 Accepted Subm ...
[SPOJ7258]Lexicographical Substring Search
[SPOJ7258]Lexicographical Substring Search 试题描述 Little Daniel loves to play with strings! He always ...
1198. Substring
1198. Substring Description Dr lee cuts a string S into N pieces,s[1],-,s[N]. Now, Dr lee gives you ...
Java substring使用时有哪些注意事项？
首先,使用substring截取字符串时,可能会出现两种异常,分别是StringIndexOutOfBoundsException和NullPointerException. 即字符串索引越界异常与 ...
leetcode 30. Substring with Concatenation of All Words 与所有单词相关联的字串滑动窗口法
题目描述给定一个字符串 s 和一些长度相同的单词 words.在 s 中找出可以恰好串联 words 中所有单词的子串的起始位置. You are given a string, s, and a ...
leetcode Longest Substring with At Most Two Distinct Characters 滑动窗口法
题目解析代码如下题目解析这一题是一道会员的题目,题目介绍如下: Given a string, find the length of the longest substring T that c ...
js中substr,substring,indexOf,lastIndexOf的用法
js中substr,substring,indexOf,lastIndexOf等的用法 1.substr substr(start,length)表示从start位置开始,截取length长度的字符串 ...
JavaScript中substr()和substring的区别
例子: var letters = "abcdefg"; console.log(letters.substr(1,3))//结果为bcd console.log(letters. ...
LeetCode.3-最长无重复字符子串(Longest Substring Without Repeating Characters)
这是悦乐书的第341次更新,第365篇原创 01 看题和准备今天介绍的是LeetCode算法题中Medium级别的第2题Longest Substring Without Repeating Cha ...

Smallest Substring

描述

输入

输出

Smallest Substring相关推荐

最新文章

热门文章