清水汪汪

2017年11月1日

摘要： Question Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Solution 1. 归并排序中的Merge过程。 2. 时间复杂度: 节点数目阅读全文

posted @ 2017-11-01 15:21 清水汪汪阅读(118) 评论(0) 推荐(0) 编辑

LeetCode——rotate-list

摘要： Question Given a list, rotate the list to the right by k places, where k is non negative. For example: Given1 2 3 4 5 NULLand k =2, return4 5 1 2 3 NU 阅读全文

posted @ 2017-11-01 14:24 清水汪汪阅读(124) 评论(0) 推荐(0) 编辑

2017年10月31日

LeetCode——jump-game-ii

摘要： Question Given an array of non negative integers, you are initially positioned at the first index of the array. Each element in the array represents y 阅读全文

posted @ 2017-10-31 22:57 清水汪汪阅读(175) 评论(0) 推荐(0) 编辑

LeetCode——jump-game

摘要： Question Given an array of non negative integers, you are initially positioned at the first index of the array. Each element in the array represents y 阅读全文

posted @ 2017-10-31 18:02 清水汪汪阅读(116) 评论(0) 推荐(0) 编辑

LeetCode——minimum-path-sum

摘要： Question Given a m x n grid filled with non negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along i 阅读全文

posted @ 2017-10-31 15:41 清水汪汪阅读(149) 评论(0) 推荐(0) 编辑

LeetCode——merge-two-sorted-lists

摘要： Question Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 阅读全文

posted @ 2017-10-31 15:25 清水汪汪阅读(128) 评论(0) 推荐(0) 编辑

LeetCode——search-in-rotated-sorted-array-ii

摘要： Question Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this affect the run time complexity? How and why? Write 阅读全文

posted @ 2017-10-31 13:39 清水汪汪阅读(182) 评论(0) 推荐(0) 编辑

LeetCode——remove-duplicates-from-sorted-list

摘要： Question Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given1 1 2, return1 2. Given1 1 2 3 3 阅读全文

posted @ 2017-10-31 12:09 清水汪汪阅读(121) 评论(0) 推荐(0) 编辑

LeetCode——remove-duplicates-from-sorted-list-ii

摘要： Question Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, 阅读全文

posted @ 2017-10-31 12:05 清水汪汪阅读(122) 评论(0) 推荐(0) 编辑

LeetCode——maximal-rectangle

摘要： Question Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area. Solution 这个题目可以借鉴 "Leet 阅读全文

posted @ 2017-10-31 11:46 清水汪汪阅读(193) 评论(0) 推荐(0) 编辑

公告