[LeetCode][440. K-th Smallest in Lexicographical Order]
By Long Luo
This article is the solution of Problem 440. K-th Smallest in Lexicographical Order.
Brute Force
1 | public int findKthNumber(int n, int k) { |
Analysis
- Time Complexity: \(O(nlogn)\).
- Space Complexity: \(O(n)\).
1 |
All suggestions are welcome. If you have any query or suggestion please comment below. Please upvote👍 if you like💗 it. Thank you:-)
Explore More Leetcode Solutions. 😉😃💗