Leetcode Rollup (c + + Java Python with title translation)

Source: Internet
Author: User

More code please see my github:https://github.com/lilong-dream/.

This article is also posted on my personal website, welcome to: http://www.lilongdream.com/2014/04/08/30.html

Leetcode topics (including AC Rates): http://oj.leetcode.com/problems/

Problem difficulty distribution, interview frequency and the use of data structure and algorithm analysis:

http://blog.csdn.net/lilong_dream/article/details/23191423

1 Two Sum

http://blog.csdn.net/lilong_dream/article/details/19298357

2 Median of two Sorted Arrays

http://blog.csdn.net/lilong_dream/article/details/19355465

3 Longest Substring without repeating Characters

http://blog.csdn.net/lilong_dream/article/details/19431417

4 ADD Two Numbers

http://blog.csdn.net/lilong_dream/article/details/19544995

5 Single

http://blog.csdn.net/lilong_dream/article/details/19556493

6 Reverse Integer

http://blog.csdn.net/lilong_dream/article/details/19674929

7 String to Integer (atoi)

http://blog.csdn.net/lilong_dream/article/details/19677643

8 Remove nth Node from end of List

http://blog.csdn.net/lilong_dream/article/details/19753021

9 Remove duplicates from Sorted Array

http://blog.csdn.net/lilong_dream/article/details/19757047

Remove Element

http://blog.csdn.net/lilong_dream/article/details/19759709

Search Insert Position

http://blog.csdn.net/lilong_dream/article/details/19768455

Unique Paths

http://blog.csdn.net/lilong_dream/article/details/19771225

Length of last Word

http://blog.csdn.net/lilong_dream/article/details/19840937

Maximum Subarray

http://blog.csdn.net/lilong_dream/article/details/19846683

Rotate List

http://blog.csdn.net/lilong_dream/article/details/19848277

Unique Paths II

http://blog.csdn.net/lilong_dream/article/details/19931301

ADD Binary

http://blog.csdn.net/lilong_dream/article/details/19995465

SQRT (x)

http://blog.csdn.net/lilong_dream/article/details/20002071

Minimum Path Sum

http://blog.csdn.net/lilong_dream/article/details/20003925

Insertion Sort List

http://blog.csdn.net/lilong_dream/article/details/20070531

Linked List Cycle

http://blog.csdn.net/lilong_dream/article/details/20073231

Linked List Cycle II

http://blog.csdn.net/lilong_dream/article/details/20074373

Sorted Merge Two Lists

http://blog.csdn.net/lilong_dream/article/details/20075857

Evaluate Reverse Polish notation

http://blog.csdn.net/lilong_dream/article/details/20204273

Max Points on a line

http://blog.csdn.net/lilong_dream/article/details/20283023

Num Sort List

http://blog.csdn.net/lilong_dream/article/details/20284389

Binary Tree Preorder Traversal

http://blog.csdn.net/lilong_dream/article/details/20306491

3Sum

http://blog.csdn.net/lilong_dream/article/details/21645437

Climbing stairs

http://blog.csdn.net/lilong_dream/article/details/21650907

Valid parentheses

http://blog.csdn.net/lilong_dream/article/details/21694751

Pow (x, N)

http://blog.csdn.net/lilong_dream/article/details/21701775

Merge Sorted Array

http://blog.csdn.net/lilong_dream/article/details/22677537

Set Matrix Zeroes

http://blog.csdn.net/lilong_dream/article/details/22744137

Remove Duplicates from Sorted List

http://blog.csdn.net/lilong_dream/article/details/22752179

Same Tree

http://blog.csdn.net/lilong_dream/article/details/22753227

Unique Binary Search Trees

http://blog.csdn.net/lilong_dream/article/details/22754969

Panax Notoginseng Plus One

http://blog.csdn.net/lilong_dream/article/details/22777347

Validate Binary Search Tree

http://blog.csdn.net/lilong_dream/article/details/22780563

Search in rotated Sorted Array

http://blog.csdn.net/lilong_dream/article/details/22864861

Integer to Roman

http://blog.csdn.net/lilong_dream/article/details/22869803

Path Sum

http://blog.csdn.net/lilong_dream/article/details/22875143

Longest Common Prefix

http://blog.csdn.net/lilong_dream/article/details/22886331

Search for a Range

http://blog.csdn.net/lilong_dream/article/details/22893675

Implement STRSTR ()

http://blog.csdn.net/lilong_dream/article/details/23655843

Generate parentheses

http://blog.csdn.net/lilong_dream/article/details/23917967

        Thank you for reading and welcome comments.

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.