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

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 Credits

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 an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.题意: 求n!后面有多少个0, 尾部这里就不考虑负数和0了, 这种情况直接认为0方法1:0只可能是10, 4x5

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

一次ACGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list. * struct ListNode { * in

一次ＡＣ关键是读懂题意记数方法基本字符IVXLCDM相应的阿拉伯数字表示为1510501005001000

Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y

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.Note: A word is

受猛人鼓舞,　开始leetcode之路.时间暂定三月.向者耕耘于杭电,北大acm .奈何题量浩繁,种类各异,良莠不齐.加之无人指点,好似永无止境,致锐气尽脱,心灰意懒.　　　leetcode题量适中,还得到高人源码与博文,喜不自胜.特记之leetcode: http://oj.leetcode.com/src1:       https://github.com/iphkwan

Binary Tree Preorder Traversal Total Accepted: 4309 Total Submissions: 12898My SubmissionsGiven a binary tree, return the preorder traversal of its nodes' values.For example:Given bi

Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi

Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the

Given a number represented as an array of digits, plus one to the number.class Solution {public: vector plusOne(vector &digits) { int len = digits.size(); int i; int

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5 / \

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

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 many distinct ways can you climb to the top?这题如果用递归, 超时了, 只能模拟了

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

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?相比之前,

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

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;

原理很简单#include using namespace std;int x[20]; //解向量int sum; //可行方案个数int n;//在第t列是否可放置bool place(int t){ int i; for(i=1; i<t; i++) //如果 行-行 == 列-列 或者 在同一列。 if(abs(t-i) == abs(x[t]-x[i])

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

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 atoi(const char *str) { bool negative = false; while(*str==' ')str++ ; if(*str=='-') { negative = true;

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

/** * 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: vector > threeSum(vector &num) { vector>result; vectorvec; int len = num.size(); //assert(len<3); sort(num.begin(),num.end());

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

Gas Station Total Accepted: 12395 Total Submissions: 50855My SubmissionsThere are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car w

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;

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 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 singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

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

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