Leetcode!
  • LeetCode!
  • My personal guide to Leetcode
  • Array
    • 11. Container With Most Water
    • 15. 3Sum
    • 219. Contains Duplicate II
    • 238. Product of Array Except Self
    • 245. Shortest Word Distance III
    • 392. Is Subsequence
    • 442. Find All Duplicates in an Array
    • 561. Array Partition I
    • 661. Image Smoother
    • 697. Degree of an Array
    • 723. Candy Crush
    • 832. Flipping an Image
  • Backtracking
    • 294. Flip Game II
    • 401. Binary Watch
    • 1079. Letter Tile Possibilities
  • Binary Search
    • 744. Find Smallest Letter Greater Than Target
    • 852. Peak Index in a Mountain Array
  • String
    • 6. ZigZag Conversion
    • 17. Letter Combinations of a Phone Number
    • 38. Count and Say
    • 521. Longest Uncommon Subsequence I
    • 544. Output Contest Matches
    • 937. Reorder Data in Log Files
  • Design
    • 251. Flatten 2D Vector
    • 281. Zigzag Iterator
  • Hash Table
    • 1. Two Sum
    • 508. Most Frequent Subtree Sum
    • 884. Uncommon Words from Two Sentences
    • 734. Sentence Similarity
  • Linked List
    • 2. Add Two Numbers
  • Unsorted
    • 917. Reverse Only Letters
  • Math
    • 43. Multiply Strings
    • 462. Minimum Moves to Equal Array Elements II
    • 553. Optimal Division
    • 800. Similar RGB Color
  • Greedy
    • 406. Queue Reconstruction by Height
    • 861. Score After Flipping Matrix
  • Tree
    • 701. Insert into a Binary Search Tree
    • 897. Increasing Order Search Tree
  • Divide and Conquer
    • 53. Maximum Subarray
  • Dynamic Programming
    • 62. Unique Paths
    • 63. Unique Paths II
    • 64. Minimum Path Sum
    • 120. Triangle
    • 198. House Robber
    • 213. House Robber II
    • 303. Range Sum Query - Immutable
    • 518. Coin Change 2
    • 750. Number Of Corner Rectangles
    • 337. House Robber III
  • Depth first search
    • 841. Keys and Rooms
  • Trie
    • 677. Map Sum Pairs
  • Two pointer
    • 42. Trapping Rain Water
Powered by GitBook
On this page
  • Approach 1: Split into Letters and Digits
  • Approach 2: Custom Sort
  1. String

937. Reorder Data in Log Files

Approach 1: Split into Letters and Digits

class Solution:
    def reorderLogFiles(self, logs: List[str]) -> List[str]:
        digits = []
        letters = []

        for log in logs:
            if log.split()[1].isdigit():
                digits.append(log)
            else:
                letters.append(log)
                
        letters.sort(key = (lambda x: (x.split()[1:], x.split()[0])))
        return letters + digits

Once we isolate the letter logs from the digit ones, sorting them independently is fairly easy. The return value then simply becomes their list concatenation

Time Complexity: O(max(Llog(L), L+ D)) for L letter strings in array or for concatenation

Space Complexity: O(N)

Approach 2: Custom Sort

class Solution:
    def key(self, log):
        id, rest = log.split(" ", 1)
        return (0, rest, id) if rest[0].isalpha() else (1,)

    def reorderLogFiles(self, logs: List[str]) -> List[str]:
        
        return sorted(logs, key = self.key)

The isolation of the log and digit ones can be avoided by encoding the digit ones in the comparison function as well. By using the decreasing order of priority on the tuple, we can assign them the right order, while still preserving the order of the digit strings by assigning them the same value.

Time Complexity: O(Nlog(N)) for L letter strings in array

Space Complexity: O(N)

Previous544. Output Contest MatchesNext251. Flatten 2D Vector

Last updated 5 years ago