![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
liyiheng123
这个作者很懒,什么都没留下…
展开
-
6. ZigZag Conversion
The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H N A P L S I I G Y原创 2017-03-08 16:01:06 · 223 阅读 · 0 评论 -
4. Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [1, 3] nums2原创 2017-03-08 16:07:02 · 214 阅读 · 0 评论 -
2. Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it原创 2017-03-08 16:16:19 · 237 阅读 · 0 评论 -
149. Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. Solution:/** * Definition for a point. * type Point struct { * X int * Y int * } */ fun原创 2017-07-05 14:28:55 · 213 阅读 · 0 评论 -
10. Regular Expression Matching
Implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element. The matching should cove原创 2017-07-05 14:32:01 · 175 阅读 · 0 评论 -
23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNo原创 2017-07-05 14:34:48 · 184 阅读 · 0 评论