希望的专栏

有梦的地方就有希望

开篇

今天刚开博客,希望自己能每天坚持编程,嘿嘿,现在刚接触C语言不久,虽然自己很菜,但是我会一直努力,迟早有一天,我会打下属于自己的一片天地! 最简单的一个小程序: #include main() { printf("Hollow everyone,I will strug...

2015-03-23 21:55:01

阅读数 509

评论数 1

【LeetCode】86. Partition List

题目: Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox. You should preserve t...

2019-06-12 22:49:54

阅读数 11

评论数 0

【LeetCode】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: Input: [ [&q...

2019-06-11 22:29:06

阅读数 1

评论数 0

【LeetCode】84. Largest Rectangle in Histogram

题目: Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the ...

2019-06-04 22:33:24

阅读数 5

评论数 0

【LeetCode】83. Remove Duplicates from Sorted List

题目: Given a sorted linked list, delete all duplicates such that each element appear onlyonce. Example 1: Input: 1->1->2 Output: 1-&...

2019-05-31 22:56:58

阅读数 2

评论数 0

【LeetCode】82. Remove Duplicates from Sorted List II

题目: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list. Example 1: Inpu...

2019-05-31 22:50:43

阅读数 2

评论数 0

【LeetCode】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]...

2019-05-29 22:56:23

阅读数 2

评论数 0

【LeetCode】80. Remove Duplicates from Sorted Array II

题目: Given a sorted arraynums, remove the duplicatesin-placesuch that duplicates appeared at mosttwiceand return the new length. Do not allocate ext...

2019-05-28 21:17:32

阅读数 3

评论数 0

【LeetCode】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...

2019-05-27 22:42:54

阅读数 2

评论数 0

【LeetCode】78. Subsets

题目: Given a set ofdistinctintegers,nums, return all possible subsets (the power set). Note:The solution set must not contain duplicate subsets. Ex...

2019-05-26 21:04:48

阅读数 1

评论数 0

【LeetCode】77. Combinations

题目: Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n. Example: Input:n = 4, k = 2 Output: [ [2,4], [3,4], ...

2019-05-24 22:57:31

阅读数 7

评论数 0

【LeetCode】76. Minimum Window Substring

题目: Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: ...

2019-05-24 20:43:58

阅读数 5

评论数 0

【LeetCode】75. Sort Colors

题目: Given an array withnobjects colored red, white or blue, sort themin-placeso that objects of the same color are adjacent, with the colors in the ...

2019-05-19 09:46:41

阅读数 3

评论数 0

【LeetCode】74. Search a 2D Matrix

题目: Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties: Integers in each row are sorte...

2019-05-17 08:59:35

阅读数 3

评论数 0

【LeetCode】73. Set Matrix Zeroes【未完待续】

题目: Given amxnmatrix, if an element is 0, set its entire row and column to 0. Do itin-place. Example 1: Input: [ [1,1,1], [1,0,1], [1,1,1] ] ...

2019-05-16 21:56:44

阅读数 6

评论数 0

【LeetCode】72. Edit Distance

题目: Given two wordsword1andword2, find the minimum number of operations required to convertword1toword2. You have the following 3 operations permit...

2019-05-15 08:57:35

阅读数 5

评论数 0

【LeetCode】71. Simplify Path

题目: Given anabsolute pathfor a file (Unix-style), simplify it. Or in other words, convert it to thecanonical path. In a UNIX-style file system, a p...

2019-05-12 22:21:28

阅读数 13

评论数 0

【LeetCode】70. Climbing Stairs

题目: You are climbing a stair case. It takesnsteps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can y...

2019-05-11 15:39:58

阅读数 15

评论数 0

【LeetCode】69. Sqrt(x)

题目: Implementint sqrt(int x). Compute and return the square root ofx, wherexis guaranteed to be a non-negative integer. Since the return typeis an...

2019-05-11 14:56:00

阅读数 17

评论数 0

【LeetCode】68. Text Justification

题目: Given an array of words and a widthmaxWidth, format the text such that each line has exactlymaxWidthcharacters and is fully (left and right) jus...

2019-05-11 11:06:54

阅读数 16

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭