国产xxxx99真实实拍_久久不雅视频_高清韩国a级特黄毛片_嗯老师别我我受不了了小说

資訊專欄INFORMATION COLUMN

[LeetCode] 937. Reorder Log Files

nemo / 1684人閱讀

Problem

You have an array of logs. Each log is a space delimited string of words.

For each log, the first word in each log is an alphanumeric identifier. Then, either:

Each word after the identifier will consist only of lowercase letters, or;
Each word after the identifier will consist only of digits.
We will call these two varieties of logs letter-logs and digit-logs. It is guaranteed that each log has at least one word after its identifier.

Reorder the logs so that all of the letter-logs come before any digit-log. The letter-logs are ordered lexicographically ignoring identifier, with the identifier used in case of ties. The digit-logs should be put in their original order.

Return the final order of the logs.

Example 1:

Input: ["a1 9 2 3 1","g1 act car","zo4 4 7","ab1 off key dog","a8 act zoo"]
Output: ["g1 act car","a8 act zoo","ab1 off key dog","a1 9 2 3 1","zo4 4 7"]

Note:

0 <= logs.length <= 100
3 <= logs[i].length <= 100
logs[i] is guaranteed to have an identifier, and a word after the identifier.

Solution
class Solution {
    public String[] reorderLogFiles(String[] logs) {
        Comparator comparator = new Comparator() {
            @Override
            public int compare(String s1, String s2) {
                int i1 = s1.indexOf(" ");
                int i2 = s2.indexOf(" ");
                char c1 = s1.charAt(i1+1);
                char c2 = s2.charAt(i2+1);
                if (c1 <= "9") {
                    return c2 <= "9" ? 0 : 1;
                } else if (c2 <= "9") {
                    return -1;
                } else {
                    //all letters
                    int res = s1.substring(i1+1).compareTo(s2.substring(i2+1));
                    if (res == 0) return s1.substring(0,i1).compareTo(s2.substring(0,i2));
                    else return res;
                }
            }
        };
        
        Arrays.sort(logs, comparator);
        return logs;
    }
}

文章版權(quán)歸作者所有,未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為,您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請注明本文地址:http://specialneedsforspecialkids.com/yun/72989.html

相關(guān)文章

  • Leetcode PHP題解--D54 937. Reorder Log Files

    摘要:題目鏈接題目分析給定一個數(shù)組,每一個元素是一條日志。剩余部分為全為小寫字母的字符串稱為字符日志或全為數(shù)字的字符串稱為數(shù)字日志。給定的數(shù)組中確定會至少有一個字母。遍歷完成后,對字符日志進行排序。在其后拼接數(shù)字日志數(shù)組,并返回即可。 D54 937. Reorder Log Files 題目鏈接 937. Reorder Log Files 題目分析 給定一個數(shù)組,每一個元素是一條日志。 ...

    hot_pot_Leo 評論0 收藏0
  • [LeetCode] 143. Reorder List

    Problem Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the lists nodes, only nodes itself may be changed. Example 1: Given 1->2->...

    miracledan 評論0 收藏0
  • [Leetcode] Reorder List 鏈表重新排序

    摘要:要找到后半部分的起點,就是用快慢指針。不過該題我們不能直接拿到中間,而是要拿到中間的前一個節(jié)點,這樣才能把第一個子鏈表的末尾置為空,這里的技巧就是快慢指針循環(huán)的條件是。注意因為不能有額外空間,我們最好用迭代的方法反轉(zhuǎn)鏈表。 Reorder List Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→...

    hufeng 評論0 收藏0
  • [LeetCode] 280. Wiggle Sort

    Problem Given an unsorted array nums, reorder it in-place such that nums[0] = nums[2] nums[i-1]) swap(nums, i, i-1); } } } private void swap(int[] nums, int i, int j) { ...

    archieyang 評論0 收藏0
  • [LeetCode] 556. Next Greater Element III

    Problem Given a positive 32-bit integer n, you need to find the smallest 32-bit integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive ...

    _ang 評論0 收藏0

發(fā)表評論

0條評論

nemo

|高級講師

TA的文章

閱讀更多
最新活動
閱讀需要支付1元查看
<