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)