484. Find Permutation
来源:互联网 发布:淘宝网天猫手机外壳 编辑:程序博客网 时间:2024/06/16 17:41
By now, you are given a secret signature consisting of character 'D' and 'I'. 'D' represents a decreasing relationship between two numbers, 'I' represents an increasing relationship between two numbers. And our secret signature was constructed by a special integer array, which contains uniquely all the different number from 1 to n (n is the length of the secret signature plus 1). For example, the secret signature "DI" can be constructed by array [2,1,3] or [3,1,2], but won't be constructed by array [3,2,4] or [2,1,3,4], which are both illegal constructing special string that can't represent the "DI" secret signature.
On the other hand, now your job is to find the lexicographically smallest permutation of [1, 2, ... n] could refer to the given secret signature in the input.
Example 1:
Input: "I"Output: [1,2]Explanation: [1,2] is the only legal initial spectial string can construct secret signature "I", where the number 1 and 2 construct an increasing relationship.
Example 2:
Input: "DI"Output: [2,1,3]Explanation: Both [2,1,3] and [3,1,2] can construct the secret signature "DI",
but since we want to find the one with the smallest lexicographical permutation, you need to output [2,1,3]
Note:
假设字符串 IDIIDD
初始化为 1234567
对于连续的 k
个连续的 D
s,只需要翻转 [i, i+k]
的数.
IDIIDD1234567 // sorted1324765 // answer
代码如下:public class Solution { public int[] findPermutation(String s) { char[] chs = s.toCharArray(); int[] res = new int[chs.length + 1]; int n = chs.length + 1; for (int i = 0; i < n; i ++) { res[i] = i + 1; } int start = 0; for (int i = 0; i < chs.length; i++) { if (chs[i] == 'D') { start = i; while (i < chs.length && chs[i] == 'D') { i ++; } reverse(res, start, i); } } return res; } private void reverse(int[] nums, int s, int e) { while (s < e) { int temp = nums[s]; nums[s] = nums[e]; nums[e] = temp; s ++; e --; } }}
- 484. Find Permutation
- leetcode 484. Find Permutation
- [leetcode]484.Find Permutation
- [Leetcode] 484. Find Permutation 解题报告
- find all the permutation of a string
- hdu 4657 Find Permutation(高效)
- Permutation
- Permutation
- permutation
- Permutation
- Permutation
- Permutation
- permutation
- Permutation
- permutation
- Permutation
- Permutation
- permutation
- ButterKnife 8.x版本在AndroidStudio中的配置
- RxJava 操作符大全
- Hibernate 缓存机制浅析
- ICE介绍及实例
- Apache+Tomcat实现负载均衡及集群(session同步)--五、session同步(2)使用共享文件
- 484. Find Permutation
- public、private、protected、default的区别
- SQL note2
- 剑指offer 面试题9 斐波那契数列/青蛙跳台阶/矩形覆盖/变态跳台阶
- 【Java】WebService 整理实例(代码实战带图文)
- Apache+Tomcat实现负载均衡及集群(session同步)--五、session同步(3)使用memcache
- mysql 字符串转正日期、时间
- web前端开发常用网址集合
- CSS部分属性,样式表,优先级