Leetcode
JerkWisdom
这个作者很懒,什么都没留下…
展开
-
Leetcode - List - 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./** * Definition for原创 2014-08-13 20:42:39 · 321 阅读 · 0 评论 -
Leetcode - Tree - 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.原创 2014-08-14 15:01:02 · 440 阅读 · 0 评论 -
Leetcode - Tree - Symmetric Tree
1、Same Tree/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */原创 2014-04-29 16:05:41 · 469 阅读 · 0 评论 -
Leetcode - Tree /Dynamic Programming- Unique Binary Search
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 unique BST's. 1 3 3 2 1 \原创 2014-08-14 15:05:39 · 438 阅读 · 0 评论 -
Leetcode - Tree - 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原创 2014-08-14 16:18:33 · 456 阅读 · 0 评论 -
Leetcode - String - Roman to Integer/Integer to Roman
1、Roman to Integer原创 2014-08-13 15:37:03 · 338 阅读 · 0 评论 -
Leetcode - Pointers/Array - 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.原创 2014-04-28 18:32:23 · 462 阅读 · 0 评论 -
Leetcode - Pointers - 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原创 2014-04-28 18:29:09 · 410 阅读 · 0 评论 -
Leetcode - Median of Two Sorted Array
利用分治算法的Merge算法,算法的复杂度应该是merge算法的一半,虽然leetcode显示Accepted,但是时间复杂度应该没有满足。时间复杂度为:O((n+m)/2)原创 2014-04-12 15:17:24 · 486 阅读 · 0 评论 -
Leetcode - vector\stack - Evaluate Reverse Polish Notation
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", "1",原创 2014-04-21 10:22:04 · 436 阅读 · 0 评论 -
Leetcode - List - Add Two Numbers
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原创 2014-08-07 20:05:51 · 348 阅读 · 0 评论 -
Leetcode - Pointers/Array - Two sum
排序的方法class Solution {public: vector twoSum(vector &numbers, int target) { vector temp=numbers; int numBegin=0; int numEnd=numbers.size()-1; vector iRet;原创 2014-08-06 20:55:23 · 388 阅读 · 0 评论 -
Leetcode - string - Reverse Words in a String
class Solution {public: void reverseWords(string &s) { istringstream record(s); string temp; vector vec; while(record>>temp) { vec.push_back(te原创 2014-04-20 21:49:46 · 400 阅读 · 0 评论 -
Leetcode - Tree - Convert Sorted Array to Binary Search Tree
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; *原创 2014-08-14 16:40:14 · 342 阅读 · 0 评论 -
Leetcode - Tree - 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原创 2014-08-14 17:32:53 · 356 阅读 · 0 评论 -
Leetcode- string/array - Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo原创 2014-08-07 16:51:47 · 391 阅读 · 0 评论 -
LeetCode - Array/Binary Search - Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.原创 2014-08-13 10:57:21 · 341 阅读 · 0 评论 -
LeetCode - Fibonacci Sequence/Dynamic Programming - 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?原创 2014-08-13 15:08:27 · 951 阅读 · 0 评论 -
Leetcode- List - Linked List Cycle
1、Linked List Cycle 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 ListNo原创 2014-08-11 21:08:01 · 286 阅读 · 0 评论 -
Leetcode - Tree- Populating Next Right Pointers in Each Node
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node.原创 2014-08-13 10:20:49 · 332 阅读 · 0 评论 -
LeetCode - Array - Maximum 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,4],the contiguous subarray [4,−1,2,1]原创 2014-08-13 21:48:24 · 295 阅读 · 0 评论 -
Leetcode - Basic - Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321原创 2014-08-07 22:27:32 · 331 阅读 · 0 评论 -
Leetcode - string - ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I原创 2014-08-07 22:11:24 · 354 阅读 · 0 评论 -
Leetcode - String - String to Integer (atoi)
class Solution {public: int atoi(const char *str) { if(str==NULL) return 0; while(*str==' ')str++; int sign=1; if(*str=='-') sign=-1,str++;原创 2014-08-07 23:15:58 · 316 阅读 · 0 评论 -
Leetcode - Tree - Binary Tree Traversal
1、Binary Tree Preorder Traversal原创 2014-08-14 15:29:58 · 432 阅读 · 0 评论 -
Leetcode - Tree - 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./** * Definition for binary tree *原创 2014-08-14 14:56:56 · 420 阅读 · 0 评论 -
Leetcode - Greedy Algorithm - Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock原创 2014-08-11 19:54:13 · 634 阅读 · 0 评论 -
Leetcode - Bit Operation/Array- Single Number
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 ext原创 2014-08-10 22:45:41 · 900 阅读 · 0 评论 -
Leetcode - Basic - Palindrome Number
class Solution {public: bool isPalindrome(int x) { if(x<0) return false; if(x==0) return true; int temp=x,digitNum=0; while(temp) {原创 2014-08-08 17:42:53 · 309 阅读 · 0 评论 -
Leetcode - Array - Merge Sorted Array
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 fro原创 2014-08-17 19:56:09 · 344 阅读 · 0 评论