@@ -0,0 +1,1348 @@
+%22%22%22Leetcode 937. Reorder Log Files%0AEasy%0A%0AURL: https://leetcode.com/problems/reorder-log-files/%0A%0AYou have an array of logs.  Each log is a space delimited string of words.%0A%0AFor each log, the first word in each log is an alphanumeric identifier.%0AThen, either:%0A- Each word after the identifier will consist only of lowercase letters, or;%0A- Each word after the identifier will consist only of digits.%0A%0AWe will call these two varieties of logs letter-logs and digit-logs.%0AIt is guaranteed that each log has at least one word after its identifier.%0A%0AReorder the logs so that all of the letter-logs come before any digit-log.%0AThe letter-logs are ordered lexicographically ignoring identifier,%0Awith the identifier used in case of ties.%0AThe digit-logs should be put in their original order.%0A%0AReturn the final order of the logs.%0A%0AExample 1:%0AInput: %5B%22a1 9 2 3 1%22,%22g1 act car%22,%22zo4 4 7%22,%22ab1 off key dog%22,%22a8 act zoo%22%5D%0AOutput: %5B%22g1 act car%22,%22a8 act zoo%22,%22ab1 off key dog%22,%22a1 9 2 3 1%22,%22zo4 4 7%22%5D%0A %0ANote:%0A- 0 %3C= logs.length %3C= 100%0A- 3 %3C= logs%5Bi%5D.length %3C= 100%0A- logs%5Bi%5D is guaranteed to have an identifier, and a word after the identifier.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def reorderLogFiles(self, logs):%0A        %22%22%22%0A        :type logs: List%5Bstr%5D%0A        :rtype: List%5Bstr%5D%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0937_reorder_log_files.py