你越努力，你的运气就会越好

struct Node { int val; int index; Node(){} Node(int x,int y):val(x),index(y){} }; bool compare(const Node &aa, const Node &bb) { return aa.val<bb.v

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers

Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; *

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

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3

Implement pow(x, n).第一个版本:double pow(double x, int n){ if(n==0) return 1.0; if(n<0) return 1.0/pow(x,-n); return x*pow(x,n-1);}超时第二个版本:class Solution {public: double pow(double

很2的一个解法, 好多情况没考虑, 只考虑正数了class Solution {public: bool isPalindrome(int x) { if(x<0)return false; int numbers = x; //位数 int digit = 0; int times = 10;

Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "

Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m, n satisfy the fol

Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reorder it to 

Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.一个小错误, 简直可以说是笔误, 浪费我近两个小时悲夫~

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, given the following triangle[ [2], [3,4], [

Implement int sqrt(int x).Compute and return the square root of x.方法相当2b之前判定超时, 于是用到了class Solution {public: int sqrt(int x) { if(x==0) return 0;

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f

Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".Have you been asked this question in an interview? YesDiscus

class Solution {public: int lengthOfLongestSubstring(string s) { int hash[256]; for(int i=0;i<256;i++) hash[i] = -1; int len = s.length(); int i;

自己整理一下leetcode的list.jf

这里进位是向后的，个位在前面下面的代码是个位

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "()()

Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.

Given preorder and inorder traversal of a tree, construct the binary tree.

class Solution {public: int threeSumClosest(vector &num, int target) { int len = num.size(); sort(num.begin(),num.end()); int diff = INT_MAX; int result;

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti

class Solution {public: string longestCommonPrefix(vector &strs) { int size = strs.size(); if(size==0) return ""; if(size==1) return strs[

class Solution {public: int atoi(const char *str) { bool negative = false; while(*str==' ')str++ ; if(*str=='-') { negative = true;

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]]Discusscl

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each

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 and sum

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/**

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.先贴一个我超时的代码:/** * Definition for

Single Number Total Accepted: 6830 Total Submissions: 14936My SubmissionsGiven an array of integers, every element appears twice except for one. Find that single one.Note:Your algori

Merge Two Sorted Lists Total Accepted: 4404 Total Submissions: 13615My SubmissionsMerge two sorted linked lists and return it as a new list. The new list should be made by splicing toget

Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the

Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.

Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.本欲援笔立就, 奈何两次夭折其一, 略else

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link