Veritas_des_Liberty

2018年10月25日

摘要： Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the 阅读全文

posted @ 2018-10-25 18:50 Veritas_des_Liberty 阅读(173) 评论(0) 推荐(0)

85. Maximal Rectangle

摘要： Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Example: AC code: Runtime: 12 ms 阅读全文

posted @ 2018-10-25 16:31 Veritas_des_Liberty 阅读(162) 评论(0) 推荐(0)

84. Largest Rectangle in Histogram

摘要： Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文

posted @ 2018-10-25 12:20 Veritas_des_Liberty 阅读(176) 评论(0) 推荐(0)

83. Remove Duplicates from Sorted List

摘要： Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Example 2: my code: Runtime: 12 ms, faster than 阅读全文

posted @ 2018-10-25 10:52 Veritas_des_Liberty 阅读(155) 评论(0) 推荐(0)

2018年10月24日

82. Remove Duplicates from Sorted List II

摘要： Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Example 1: Example 2: 阅读全文

posted @ 2018-10-24 18:07 Veritas_des_Liberty 阅读(203) 评论(0) 推荐(0)

81. Search in Rotated Sorted Array II

摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]). Y 阅读全文

posted @ 2018-10-24 17:36 Veritas_des_Liberty 阅读(151) 评论(0) 推荐(0)

80. Remove Duplicates from Sorted Array II

摘要： Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra 阅读全文

posted @ 2018-10-24 16:39 Veritas_des_Liberty 阅读(190) 评论(0) 推荐(0)

79. Word Search

摘要： Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjac 阅读全文

posted @ 2018-10-24 15:47 Veritas_des_Liberty 阅读(240) 评论(0) 推荐(0)

78. Subsets

摘要： Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Exampl 阅读全文

posted @ 2018-10-24 12:02 Veritas_des_Liberty 阅读(176) 评论(0) 推荐(0)

77. Combinations

摘要： Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. Example: AC code: Runtime: 88 ms, faster than 42.24% of C++ 阅读全文

posted @ 2018-10-24 11:03 Veritas_des_Liberty 阅读(283) 评论(0) 推荐(0)

Veritas des Liberty

公告