c/c++
文章平均质量分 70
yunwu753
这个作者很懒,什么都没留下…
展开
-
[LeetCode 118] Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,1、vector二维数组。2、要养成检查代码的习惯,不要写完马上提交。class Solution {public: vector > generate(int numRow原创 2015-03-14 21:16:31 · 224 阅读 · 0 评论 -
[LeetCode 88] Merge Sorted Array水题都不能一次AC
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from原创 2015-03-15 15:47:49 · 417 阅读 · 0 评论 -
[LeetCode 169] Majority Element
Given 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 non-empty and the majority element原创 2015-03-15 17:14:32 · 234 阅读 · 0 评论 -
[LeetCode 1] Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe原创 2015-03-15 22:01:25 · 197 阅读 · 0 评论 -
[LeetCode 119] Pascal's Triangle II
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?我写的代码,用的递归,T原创 2015-03-15 10:03:35 · 222 阅读 · 0 评论 -
[LeetCode 36] Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fille原创 2015-03-16 11:01:54 · 161 阅读 · 0 评论 -
[LeetCode 172] Factorial Trailing Zeroes
原文地址:点击打开链接Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.class Solution {public: int trailingZeroes(int n转载 2015-03-20 09:41:52 · 197 阅读 · 0 评论 -
[LeetCode 21] Merge 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.关于C++中结构体中的构造函数的知识,参考点击打开链接写这种代码有种回到大学的感觉/** * Def原创 2015-03-16 16:51:46 · 254 阅读 · 0 评论 -
[LeetCode 7] Reverse Integer 不能一次AC的总结
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before c原创 2015-03-20 10:56:45 · 184 阅读 · 0 评论 -
[LeetCode 83] 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.Given 1->1->2->3->3, return 1->2->3.有序表中通过率最高的题/** * D原创 2015-03-20 17:18:21 · 314 阅读 · 0 评论 -
[LeetCode 19] Remove Nth Node From End of List
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原创 2015-03-20 16:40:13 · 206 阅读 · 0 评论 -
[LeetCode 155] Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get原创 2015-03-17 09:51:56 · 203 阅读 · 0 评论 -
[LeetCode 110] Balanced 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 of the two subtrees of every node never diffe原创 2015-03-27 10:39:17 · 220 阅读 · 0 评论 -
[LeetCode 101] Symmetric Tree
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原创 2015-03-27 21:09:23 · 164 阅读 · 0 评论 -
[LeetCode 100] Same Tree
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.1、跟101题是一个原创 2015-03-27 21:11:46 · 201 阅读 · 0 评论 -
[LeetCode 160] Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘原创 2015-03-20 22:02:56 · 152 阅读 · 0 评论 -
[LeetCode 191] Number of 1 Bits
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 00000000原创 2015-03-20 23:35:24 · 206 阅读 · 0 评论 -
[LeetCode 14] Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.1、string的length()和size()没有区别,size()更符合std的规范,length()是c语言中习惯的用法。2、删除函数iterator erase(iterator first, iterato原创 2015-03-11 09:52:56 · 302 阅读 · 0 评论 -
[LeetCode 190] Reverse Bits
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as0011100101原创 2015-03-21 14:54:01 · 287 阅读 · 0 评论 -
[LeetCode 8] String to Integer (atoi)
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ca原创 2015-03-11 16:08:10 · 205 阅读 · 0 评论 -
[LeetCode 13] Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.1、此题并不需要考虑罗马数字输入的合法性。2、此题当前的符号并不能马上确定它的值,与后边输入的符号也有关系。之前只是考虑输入当前符号时,比较后面的符号。这样考虑时,原创 2015-03-10 20:24:58 · 261 阅读 · 0 评论 -
[LeetCode 38] Count and Say
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as原创 2015-03-10 21:53:49 · 256 阅读 · 0 评论 -
[LeetCode 165] Compare Version Numbers
Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co原创 2015-03-10 20:20:20 · 214 阅读 · 0 评论 -
C++栈和队列
原文地址:点击打开链接使用标准库的栈和队列时,先包含相关的头文件#include#include定义栈如下:stack stk;定义队列如下:queue q;栈提供了如下的操作[cpp] view plaincopys.empty() 如果栈为空返回tru转载 2015-03-12 08:39:02 · 187 阅读 · 0 评论 -
[LeetCode 20]
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va原创 2015-03-12 09:12:18 · 210 阅读 · 0 评论 -
[LeetCode 189] Rotate Array——我五个小时的纠结
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as yo原创 2015-03-13 08:46:03 · 326 阅读 · 0 评论 -
[LeetCode 27] Remove 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 what you leave beyond the new length.1原创 2015-03-13 10:57:16 · 363 阅读 · 0 评论 -
[LeetCode 26] Remove Duplicates from Sorted Array
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原创 2015-03-13 15:11:55 · 204 阅读 · 0 评论 -
[LeetCode 125] Valid Palindrome 内附re生成原因
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a原创 2015-03-11 14:23:27 · 269 阅读 · 0 评论 -
[LeetCode 111] Minimum Depth of Binary Tree
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.如果一个节点的左子树或右子树为空,那么最短路径就是不为空的子树的深度原创 2015-03-30 15:42:16 · 189 阅读 · 0 评论 -
[LeetCode 104] Maximum Depth of Binary Tree
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.递归,有非递归的解法,等看到再说吧。/** * Defin原创 2015-03-30 15:36:32 · 212 阅读 · 0 评论 -
[LeetCode 58] Length of Last Word
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原创 2015-03-12 15:12:18 · 200 阅读 · 0 评论 -
[LeetCode 66] Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.代码比较长1、vector中ca原创 2015-03-14 20:18:31 · 309 阅读 · 0 评论 -
[LeetCode 168] Excel Sheet Column Title
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 要注意对26的原创 2015-03-18 20:41:40 · 202 阅读 · 0 评论 -
[LeetCode 171] Excel Sheet Column Number
Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 很简单的一道题cla原创 2015-03-18 20:56:57 · 158 阅读 · 0 评论 -
[LeetCode 9] Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of convertin原创 2015-03-18 21:09:01 · 199 阅读 · 0 评论 -
[LeetCode 198] House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house转载 2015-04-13 20:25:44 · 335 阅读 · 0 评论 -
[LeetCode 112] Path Sum
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原创 2015-04-13 10:53:21 · 243 阅读 · 0 评论 -
[LeetCode 102] Binary Tree Level Order Traversal
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原创 2015-04-13 13:47:26 · 295 阅读 · 0 评论 -
[LeetCode 70] Climbing Stairs
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?1、第一次接触动态规划的问题。2、参考点击打开链原创 2015-04-13 15:42:04 · 255 阅读 · 0 评论