07 2015 档案

【LeetCode 227】Basic Calculator II
摘要：Implement a basic calculator to evaluate a simple expression string.The expression string contains onlynon-negativeintegers,+,-,*,/operators and empty... 阅读全文
posted @ 2015-07-30 18:30 tjuloading 阅读(382) 评论(0) 推荐(0)
【LeetCode 241】Different Ways to Add Parentheses
摘要：Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. Th... 阅读全文
posted @ 2015-07-27 16:48 tjuloading 阅读(195) 评论(0) 推荐(0)
【LeetCode 29】Divide Two Integers
摘要：Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.题意： 实现除法，但不允许用乘、除、以及取模运算。思路： 一下一下减必然显得... 阅读全文
posted @ 2015-07-24 17:00 tjuloading 阅读(152) 评论(0) 推荐(0)
【LeetCode 240】Search a 2D Matrix II
摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted in asc... 阅读全文
posted @ 2015-07-23 13:57 tjuloading 阅读(172) 评论(0) 推荐(0)
【LeetCode 34】Search for a Range
摘要：Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文
posted @ 2015-07-19 15:27 tjuloading 阅读(173) 评论(0) 推荐(0)
【LeetCode 239】Sliding Window Maximum
摘要：Given an arraynums, there is a sliding window of sizekwhich is moving from the very left of the array to the very right. You can only see theknumbers ... 阅读全文
posted @ 2015-07-18 15:03 tjuloading 阅读(221) 评论(0) 推荐(0)
【LeetCode 238】Product of Array Except Self
摘要：Given an array ofnintegers wheren> 1,nums, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].Solv... 阅读全文
posted @ 2015-07-16 15:06 tjuloading 阅读(488) 评论(0) 推荐(0)
【LeetCode 237】Delete Node in a Linked List
摘要：Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is1 -> 2 -> 3 -> ... 阅读全文
posted @ 2015-07-15 16:08 tjuloading 阅读(699) 评论(0) 推荐(0)
【LeetCode 236】Lowest Common Ancestor of a Binary Tree
摘要：Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to thedefinition of LCA on Wikipedia: “The lowest ... 阅读全文
posted @ 2015-07-15 16:01 tjuloading 阅读(167) 评论(0) 推荐(0)
【剑指offer 面试题47】不用加减乘除做加法
摘要：思路： 利用位运算C++： 1 #include 2 using namespace std; 3 4 int main() 5 { 6 int a = 11, b = 17; 7 int sum, carry; 8 do 9 {10 sum =... 阅读全文
posted @ 2015-07-14 14:04 tjuloading 阅读(114) 评论(0) 推荐(0)
【剑指offer 面试题38】数字在排序数组中出现的次数
摘要：思路： 利用二分查找，分别查找待统计数字的头和尾的下标，最后做差加一即为结果。C++： 1 #include 2 #include 3 using namespace std; 4 5 int GetFirstK(vector& nums, int startpos, int endpos,... 阅读全文
posted @ 2015-07-12 16:44 tjuloading 阅读(145) 评论(0) 推荐(0)
【LeetCode 235】Lowest Common Ancestor of a Binary Search Tree
摘要：Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to thedefinition of LCA on Wikipedia: ... 阅读全文
posted @ 2015-07-12 16:08 tjuloading 阅读(163) 评论(0) 推荐(0)
【LeetCode 234】Palindrome Linked List
摘要：Given a singly linked list, determine if it is a palindrome.思路： 用快慢指针找到链表中点，反转后半部分链表，然后与前半部分进行匹配，随后将链表恢复原状（本题没有这个要求，具体情况具体对待）。C++： 1 /** 2 * Definit... 阅读全文
posted @ 2015-07-12 14:54 tjuloading 阅读(179) 评论(0) 推荐(0)
【剑指offer 面试题34】丑数
摘要：只包含因子2、3、5的数称作丑数。 1 #include 2 #include 3 using namespace std; 4 5 int GetUglyNumber(int n) 6 { 7 if(n UglyNum(n, 0);11 UglyNum[0] = 1;12 ... 阅读全文
posted @ 2015-07-09 21:13 tjuloading 阅读(161) 评论(0) 推荐(0)
【剑指offer 面试题27】二叉搜索树与双向链表
摘要：输入一颗二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。C++: 1 #include 2 using namespace std; 3 4 struct TreeNode 5 { 6 int val; 7 TreeNode *left; 8 TreeNode *... 阅读全文
posted @ 2015-07-08 21:15 tjuloading 阅读(136) 评论(0) 推荐(0)
【排序算法模板】归并排序
摘要：1 #include 2 #include 3 using namespace std; 4 5 void Merge(vector& nums, const int first, const int mid, const int last, vector&temp) 6 { 7 i... 阅读全文
posted @ 2015-07-07 19:46 tjuloading 阅读(175) 评论(0) 推荐(0)
【排序算法模板】快速排序
摘要：1 #include 2 #include 3 using namespace std; 4 5 void quickSort(vector& nums, const int lpos, const int rpos) 6 { 7 if(lpos = key)16 ... 阅读全文
posted @ 2015-07-07 17:53 tjuloading 阅读(158) 评论(0) 推荐(0)
【剑指offer 面试题23】从上往下打印二叉树
摘要：思路： 没啥好说的，BFS。C++： 1 #include 2 #include 3 using namespace std; 4 5 struct TreeNode { 6 int val; 7 TreeNode *left; 8 TreeNode *right; ... 阅读全文
posted @ 2015-07-06 22:38 tjuloading 阅读(167) 评论(0) 推荐(0)
【剑指offer 面试题22】栈的压入、弹出序列
摘要：思路： 不停地压栈，直到栈头元素与弹出序列的首元素相等则出栈，同时弹出序列后移；若不相等则一直保持压栈，直到压入所有元素后弹出序列仍不为空，则说明无法匹配。C++: 1 #include 2 #include 3 #include 4 using namespace std; 5 6 bo... 阅读全文
posted @ 2015-07-06 22:17 tjuloading 阅读(141) 评论(0) 推荐(0)
【LeetCode 99】Recover Binary Search Tree
摘要：Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.题意： 一颗二叉搜索树中有2个结点的元素被误换了，要求恢复二叉搜索树的... 阅读全文
posted @ 2015-07-06 19:46 tjuloading 阅读(220) 评论(0) 推荐(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: a... 阅读全文
posted @ 2015-07-06 15:54 tjuloading 阅读(124) 评论(0) 推荐(0)
【LeetCode 173】Binary Search Tree Iterator
摘要：Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callingnext()will return the next... 阅读全文
posted @ 2015-07-06 14:23 tjuloading 阅读(177) 评论(0) 推荐(0)
【LeetCode 231】Power of Two
摘要：Given an integer, write a function to determine if it is a power of two.思路： 如果一个数是2的Power，那么该数的二进制串中只有一位为1，其余都为0。执行一次n & (n - 1)可消除最低位的一个1，若消除后为0，则说明... 阅读全文
posted @ 2015-07-06 12:35 tjuloading 阅读(310) 评论(0) 推荐(0)
【LeetCode 230】Kth Smallest Element in a BST
摘要：Given a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is always valid, 1 ≤ k ≤ BST's tota... 阅读全文
posted @ 2015-07-02 21:10 tjuloading 阅读(448) 评论(0) 推荐(0)
【LeetCode 201】Bitwise AND of Numbers Range
摘要：Given a range [m, n] where 0 >=1; 7 n>>=1; 8 offset++; 9 }10 return m> 110 n = n >> 111 ... 阅读全文
posted @ 2015-07-01 21:37 tjuloading 阅读(542) 评论(0) 推荐(0)
【LeetCode 229】Majority Element II
摘要：Given an integer array of sizen, find all elements that appear more than⌊ n/3 ⌋times. The algorithm should run in linear time and in O(1) space.思路： 【... 阅读全文
posted @ 2015-07-01 20:01 tjuloading 阅读(305) 评论(0) 推荐(0)
【LeetCode 169】Majority Element
摘要：Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may assume that the arr... 阅读全文
posted @ 2015-07-01 19:44 tjuloading 阅读(344) 评论(0) 推荐(0)