IMISSHOT的博客

今天开始刷LeedCode了.发现智商不够用了.有些解题方法是Goole来的...答题语言都是c语言，顺便也是巩固了一下数据结构原题链接：点击打开链接/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }

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 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 differ

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the

Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).For example: Given binary tree [3,9,20,null,null,15,

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 differ

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,return 给一个二叉树和一个数字sum，让你找出所有路径和为su

Say 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 complete as many transactions as you like (ie, buy one

Given a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?判断一个链表是否有环。条件是能否用O（1）的空间复杂度解决这个问题。既然不让我们用多余的空间，那么我们首先想到的是遍历这个链表，我们维持两个指针，一个快，一个慢，如果有环的

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.这道题的目的就是求二叉树的最小高度. 和求二叉树高度不同的是，它需要判断每

say you have an array for witch the i th element is the price of a given stock on day i. if you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),

Given a string, determine if it is a palindrome. considering only alphanumeric characters and ignoring cases.Notes: Have you consider the string might be empty?class Solution{ bool isPalind

/*2017.10.7LeetCode : Remove Element 把数组中和val相等的值覆盖掉就行了.*/int removeElement(int* nums, int numsSize, int val) { int i, k = 0; for(i = 0; i < numsSize; i++){ if(nums[i] != val

/*2017.10.7LeetCode : RemoveDuplicates form Sort Array*/int removeDuplicates(int* nums, int numsSize) { int k = 0, i; if (numsSize == 0) return numsSize; for(i = 1; i < nu

/*2017.10.7//LeedCode : Remove Duplicates from Sorted Array II 需要一个计数器,如果重复次数小于2，就把这个元素放到新数组里.*/int removeDuplicates(int* nums, int numsSize) { int k = 0, i, cnt = 1;; if(numsSize ==

/*2017.10.8LeedCode:plusone开始学c++了*/class Solution {public: vector plusOne(vector& digits) { vector ret(digits.size(), 0); int one = 1; for(int i = digits.size()-1; i

我对KMP算法的理解翻译自： jBoxer's blog    原文链接: http://jakeboxer.com/blog/2009/12/13/the-knuth-morris-pratt-algorithm-in-my-own-words/    在过去的几天，我读了好几篇关于“利用KMP算法查找字符串的解释”的文章。出于某些原因，没有一篇是能令我接受和理解的。每当

Given a binary tree, check whether it is a mirror of itself. For example, the binary tree[1,2,2,3,4,4,3] is a symmetric tree. Notes bonus points if you could solve it both recursively and iterat

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 fastest leaf node. /*struct TreeNode{ int val;

Given an array of integers, every element appears twice except for one. find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra

leetcode 开始收费了，开始转战lintcode。Write a function that add two numbers A and B. You should not use + or any arithmetic operators. ClarificationAre a and b both 32-bit integers?Yes.Can I use bit