2019年8月4日
Min swaps to sort array
摘要： Given an array with distinct numbers, return an integer indicating the minimum number of swap operations required to sort the array into ascending ord 阅读全文
posted @ 2019-08-04 08:48 北叶青藤 阅读(212) 评论(0) 推荐(0)
Longest Increasing Subsequence
摘要： Find the longest increasing subsequence in an array. If there are multiple, return one of them. Example, for [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 阅读全文
posted @ 2019-08-04 05:34 北叶青藤 阅读(123) 评论(0) 推荐(0)