# 类别归档：LeetCode

LeetCode OJ is a platform for preparing technical coding interviews.

## 题目描述：

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

``````A:          a1 → a2
↘
c1 → c2 → c3
↗
B:     b1 → b2 → b3
``````

begin to intersect at node ...

## 题目描述：

Sort a linked list in O(n log n) time using constant space complexity.

## Python代码：

``````# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self ...``````

## 题目描述：

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• getMin() -- Retrieve ...

## 题目描述：

LeetCode 154. Find Minimum in Rotated Sorted Array II

Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Suppose a sorted array is rotated at ...

## [Leetcode]Max Points on a Line 作者是 在线疯狂 发布于 2014年10月16日 在 LeetCode, Python.

### 题目描述

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.