给永远比拿愉快

文章目录LeetCode-Longest Palindromic Substring题目描述思路分析C++实现Scala实现版权声明：本文为博主原创文章，转载请注明原文出处！写作时间：2019-02-10 00:04:34LeetCode-Longest Palindromic Substring题目描述LeetCode第5道题目：5. Longest Palindromic Subst...

文章目录LeetCode-Palindromic Substrings题目描述思路分析C++实现Scala实现LeetCode-Palindromic Substrings题目描述这是第647道题目：Palindromic SubstringsGiven a string, your task is to count how many palindromic substrings in t...

文章目录Minimum Falling Path Sum题目描述问题分析C++实现Scala实现Minimum Falling Path Sum题目描述本题目链接：931. Minimum Falling Path SumGiven a square array of integers A, we want the minimum sum of a falling paththrough ...

文章目录Minimum Cost For Tickets题目描述算法描述C++实现Scala实现Minimum Cost For Tickets题目描述LeetCode地址：983. Minimum Cost For TicketsIn a country popular for train travel, you have planned some train travelling on...

303. Range Sum Query - Immutable题目描述Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRang...

Min Cost Climbing Stairs题目On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).Once you pay the cost, you can either climb one or two steps. You need to find m...

LeetCode题解-AddTwoNumbers问题描述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...

LeetCode题解 - Two Sum问题描述Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution,...

题目：Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:

Implement int sqrt(int x).Compute and return the square root of x.依然二分法….这道题虽然简单，但是有一些细节需要注意，我是提交了好几遍才通过的！参考代码：class Solution {public: int mySqrt(int x) { if (x < 2) return x;

Implement pow(x, n).实现乘幂运算，给出的提示是Bianry Search。其实就是利用公式xn=xn/2∗xn/2∗xn%2x^n = x^{n/2} * x^{n/2} * x^{n\%2}进行运算。参考代码：class Solution {private: double power(double x, int n) { if (0

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ’s undirected graph serialization: Nodes are labeled uniquely.We use # as a separator for each node, an

最近都在复习英语，看见看得头都大了，而且阅读越做分数越低！换个环境，做做Leetcode试题！题目：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, g

题目： Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 001110010

题目： Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For example, If S

题目： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent h

题目：Given an array of integers, every element appears twice except for one. Find that single one.Your algorithm should have a linear runtime complexity. Could you implement it without using extra m

问题：Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.解答：（这个问题不难，但

题目：Given an array of integers, every element appears three times except for one. Find that single one.

Given two integers n and k, return all possible combinations ofk numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]

问题：Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.分析：1.将

题目如下：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.即求二叉树的（最大）深度。有两种思路：一是使用递归，二

题目：Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.解答：bo

题目：Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ...

问题：Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB 解答：

问题：Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.解决方案：因为是有序列表所以我们只

题目：Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible inp

题目：Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many solutions as you can, there

题目： Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.即要求计算n的阶乘结果中后面0的个数。分析： 对n!做质因数分解有：n!=2x*3y*5z*… 显然0的个数等于min(x,z)，并且min

问题描述： Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority eleme

题目： Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and

题目：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 ↘

题目： 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

题目： Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car” is not a

题目：Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]杨辉三角相信是大家再熟悉不过的啦，这

题目： Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].Note: Could you optimize your algorithm to use only O(k) extra space? 思路分析： 还是杨辉三角的问题。题目

题目：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree a

题目： Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.思路分析： 二叉树多用迭代C++示例代码：/** * Definitio

题目： Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe

题目：Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20