leetcode

[LeetCode-interview algorithm classic-Java implementation] [219-Contains Duplicate II (including Duplicate element II)], leetcode -- java [219-Contains Duplicate II (including Duplicate element II )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Download the Code [https://github.com/wang-jun-chao]Original question

[LeetCode-interview algorithm classic-Java implementation] [216-Combination Sum III (Sum of the number of combinations)], leetcode -- java [216-Combination Sum III (Sum of the number of combinations )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Download the Code [https://github.com/wang-jun-chao]Original questio

[LeetCode-interview algorithm classic-Java implementation] [062-Unique Paths (Unique path)], leetcode -- java [062-Unique Paths (Unique path )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question A robot is located at the top-left corner ofm x nGrid (marked 'start' in the dimo-below ).The robot can only

[LeetCode-interview algorithm classic-Java implementation] [058-Length of Last Word (Length of the Last Word)], leetcode -- java [058-Length of Last Word (Length of the Last Word )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a string s consists of upper/lower-case alphabets and empty spac

[LeetCode-interview algorithm classic-Java implementation] [075-Sort Colors (Color Sorting)], leetcode -- java [075-Sort Colors (Color Sorting )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given an array with n objects colored red, white or blue, sort them so that objects of the same color are

[LeetCode-interview algorithm classic-Java implementation] [098-Validate Binary Search Tree (verify Binary Search Tree)], leetcode -- java [098-Validate Binary Search Tree (verify Binary Search Tree )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a binary tree, determine if it is a valid bi

[LeetCode-interview algorithm classic-Java implementation] [067-Add Binary (Binary addition)], leetcode -- java [067-Add Binary (Binary addition )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given two binary strings, return their sum (also a binary string ).For example,A ="11" B ="1" Return"100

[LeetCode-interview algorithm classic-Java implementation] [064-Minimum Path Sum (Minimum Path and)], leetcode -- java [064-Minimum Path Sum (Minimum Path and )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a m x n grid filled with non-negative numbers, find a path from top left to bottom r

[LeetCode-interview algorithm classic-Java implementation] [101-Symmetric Tree], leetcode -- java [101-Symmetric Tree )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a binary tree, check whether it is a mirror of itself (ie, shortric around its center ).For example, this binary tree is unsu

[LeetCode-interview algorithm classic-Java implementation] [079-Word Search], leetcode -- java [079-Word Search )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question 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,

[LeetCode-interview algorithm classic-Java implementation] [070-Climbing Stairs (Stairs)], leetcode -- java [070-Climbing Stairs )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how

Leetcode: Best Time to Buy and keep Stock IV, leetcode= Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most k transactions.Note:You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again). This question has been done in Best Time to Buy and Stock III

[LeetCode-interview algorithm classic-Java implementation] [014-Longest Common Prefix (Longest Common Prefix)], leetcode -- java [014-Longest Common Prefix (Longest Common Prefix )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Write a function to find the longest common prefix string amongst an a

[LeetCode-interview algorithm classic-Java implementation] [012-Integer to Roman (number to Rome character)], leetcode -- java [012-Integer to Roman )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to

[LeetCode-interview algorithm classic-Java implementation] [011-ContainerWithMostWater (the most water)], leetcode -- java [011-ContainerWithMostWater (Maximum capacity of water )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given n non-negative integers a1, a2 ,..., An, where each represents a

[LeetCode-interview algorithm classic-Java implementation] [007-Reverse Integer (Flip Integer)], leetcode -- java [007-Reverse Integer (Flip Integer )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Reverse digits of an integer.Example1: x = 123, return 321Example2: x =-123, return-321 Theme Enter

[LeetCode-interview algorithm classic-Java implementation] [006-ZigZag Conversion (Z-type Conversion)], leetcode -- java [006-ZigZag Conversion (Z-type Conversion )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows l

[LeetCode-interview algorithm classic-Java implementation] [008-String to Integer (atoi) (String to Integer)], leetcode -- java [008-String to Integer (atoi) (String to Integer )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Implement atoi to convert a string to an integer.Hint: Carefully conside

[LeetCode-interview algorithm classic-Java implementation] [021-Merge Two Sorted Lists (Merge Two Sorted Single-Chain tables)], leetcode -- java [021-Merge Two Sorted Lists )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Merge two sorted linked lists and return it as a new list. The new list shos

[LeetCode-interview algorithm classic-Java implementation] [056-Merge Intervals (range Merge)], leetcode -- java [056-Merge Intervals (Merge Intervals )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a collection of intervals, merge all overlapping intervals.For example,Given[1,3],[2,6],[8,1