试题 Given an unsorted array of integers, find the length of longest increasing subseque

试题 Given a string containing just the characters ‘(’, ‘)’, ‘\{’, ‘\}’, ‘\[’ and ‘\]’,

试题 Given n pairs of parentheses, write a function to generate all combinations of well

试题： Given a string which consists of lowercase or uppercase letters, find the length o

试题： There are a number of spherical balloons spread in two-dimensional space. For each

试题 You are given a list of non-negative integers, a1, a2, …, an, and a target, S. Now

试题： Given two words word1 and word2, find the minimum number of steps required to make

试题： Write a program to find the node at which the intersection of two singly linked li

试题： Given a positive integer n, break it into the sum of at least two positive integer

试题： Given a string of numbers and operators, return all possible results from computin

试题： Find the kth largest element in an unsorted array. Note that it is the kth largest

试题： Given a non-empty string s, you may delete at most one character. Judge whether yo

试题： Given an array of integers that is already sorted in ascending order, find two num

试题： Given a non-negative integer c, your task is to decide whether there’re two intege

试题： Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

试题： Write a function to find the longest common prefix string amongst an array of stri

试题 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Problem: Given an array of integers, return indices of the two numbers such that they

试题 Determine whether an integer is a palindrome. Do this without extra space. 代码

一、试题 Implement atoi to convert a string to an integer. Hint: Carefully consider all

一、题目 Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input:

一、试题 Given a string s, find the longest palindromic substring in s. You may assume th

一、题目 Given an array of integers, return indices of the two numbers such that they add

题目描述     “回文串”是一个正读和反读都一样的字符串，比如“level”或者“noon”等等就是回文串。现在呢，就是让你判断输入的字符串是否是回文串。 输入

【题目描述】 给定一个由 ‘(’ 和 ‘)’ 括号组成的字符串 S，我们需要添加最少的括号（ ‘(’ 或是 ‘)’，可以在任何位置），以使得到的括号字符串有效。 从形式上

这里写目录标题 时间转换（I） 数字求和 一二三 三家人 汽水瓶 数字整除 时间转换（I） 题目描述 输入一个正整数（

题目 给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。 你可以假设每种输入只会对应一个答案。

试题： Given a binary tree, write a function to get the maximum width of the given tree.

试题： Given a triangle, find the minimum path sum from top to bottom. Each step you may

试题 There are N gas stations along a circular route, where the amount of gas at station

试题 Given an array of integers nums, sort the array in ascending order. Example 1: In

试题 Implement the following operations of a queue using stacks. push(x) – Push element

坚持坚持再坚持!无论错多少遍!你总能做出来的 -------------------- 下面贴上leetcode的一道简单的题目 :  给出一个 32 位的有符号整数

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3Fpbmdf

Let’s play the minesweeper game (Wikipedia, online game)! You are given a 2D char ma...