guicaisa的博客

leetcode刷题217Contains DuplicateGiven an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it shou

leetcode刷题35Search Insert Position 最近刷题还比较有感觉，，难道是我水平在提高？。。其实是做到了比较简单的题目。。。Given a sorted array and a target value, return the index if the target is found. If not, return the index wh

leetcode168题。先进行取模计算，得到最后一个位的字符，然后再进行求商运算，获得前面位的字符值，从右向左添加至结果字符串中。考虑到52应该是AZ，所以必须减去1，再进行求商运算，才能得到第一位是Aclass Solution {public: string convertToTitle(int n) { string result; char ch;

leetcode226题。invert Binary Tree倒置二叉树。想不到这题还有个梗，挺有意思的。我一开始自作聪明，想用一个栈一个队列来做，用中序遍历，把节点push进栈中，把节点的指push进队列中，遍历完之后，分别从栈顶和队列顶拿出节点和数值，赋值。一开始想着感觉还挺对的，，递交了几次都没过，后来我发现加入最右的子叶节点为空，，，那赋值就全错位了。。应该是在一个满二叉树的情况才适用

leetcode题目171Related 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

leetcode169Majority ElementGiven 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 no

leetcode144题。Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note:

leetcode137Single Number II 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 comp

Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio

从通过率最高的题目开始136 Single Number找出数组里唯一一个只出现一次的数字。通过这个题目知道位异或运算符连续异或2个相同的数字得到0。/*Given an array of integers, every element appears twice except for one. Find that single one. *Note: *Your algorithm

leetcode刷题53Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5

leetcode83.Remove Duplicates from Sorted List Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Giv

leetcode 100题是判断2个二叉树是否相同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

leetcode104题，计算二叉树的深度。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.第一种方法采用递归，以遍历到

leetcode70Climbing StairsYou 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?

leetcode13Roman to IntegerGiven a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.这个题目，，不说了，，，去百度罗马数字的一些规则，，，比如C在D或者M前面是-100的意思。上代码。。。

leetcode141题。Given 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 {

leetcode108Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.这个题目使用递归和二分即可，一直寻找数组的中点，作为根节点，将数组截为两半，分别递归

leetcode12Integer to RomanGiven an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999之前那个题的姊妹篇，首先强调！没什么难的，，，把罗马数字的规则搞搞清楚就行了，，，我写的代码写的太多了，，，全

leetcode116题Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its

leetcode191题，求一个32无符号整数中位为1的个数，2种方法，最简单的就是使用c++中bitset容器，直接使用count()这个成员函数即可class Solution {public: int hammingWeight(uint32_t n) { bitset bu(n); return bu.count();

leetcode232Implement Queue using Stacks Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in

leetcode153。。。Find Minimum in Rotated Sorted Array Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Fi

leetcode145Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2

leetcode75Sort Colors 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

leetcode62Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in

leetcode27Remove Element 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 wha

leetcode刷题154Best Time to Buy and Sell Stock IISay 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

leetcode48Rotate Image You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?这个题目，直接用列作为外层循环，

leetcode刷题96Unique Binary Search Trees Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 uni

leetcode21Merge Two Sorted Lists Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.不是很难的一个题目，

leetcode121Best Time to Buy and Sell Stock Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one t

leetcode64Minimum Path Sum 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: 

leetcode110Balanced Binary Tree 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

leetcode24Swap Nodes in Pairs 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

leetcdoe22Generate Parentheses 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:

leetcode206Reverse Linked List Reverse a singly linked list这个类型的题目我之前做过一次，那次我是用递归写的，但是这次我用递归写却超时了，，具体方法就是一头栽进链表最下面，然后返回，将每一层节点一个一个钩在后面即可。由于超时我就老老实实的使用了栈来使用，还是比较简单，入栈再弹栈，不多说了。

leetcode46Permutations Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,

leetcode238Product of Array Except Self Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums

leetcode11Container With Most Water Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two e