算法题牛客网NC88 寻找第K大
题目: 思路就是做个排序,要求时间复杂度 O ( n log n ) O(n\log n) O(nlogn),因此选用快排。代码:
class Solution:def quickSort(self, a, start, end):if start > end:returnval a[start]…
难度:moderate
Write a simple version of the UNIX find program for xv6: find all the files in a directory tree with a specific name. Your solution should be in the file user/find.c.
题目要求:实现find ,即在某个路径中,找出某…