摘要：题目描述，点击此处//copied from here:http://blog.csdn.net/zxzxy1988/article/details/8587244double findKth(int a[], int m, int b[], int n, int k){ //always assume that m is equal or smaller than n if (m > n) return findKth(b, n, a, m, k); if (m == 0) return b[k - 1]; if (k == 1) ... 阅读全文
leetcode - Maximum Subarray
2013-04-28 19:29 by 张汉生, 146 阅读, 0 推荐, 收藏, 编辑
摘要：题目描述：点击此处经典的字段和问题 1 class Solution { 2 public: 3 int maxSubArray(int A[], int n) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 if (n<=0) 7 return 0; 8 int maxSum = -2000000000; 9 int b = maxSum, i;10 for (i=0; i<n; i++){11 ... 阅读全文
leetcode - Maximum Depth of Binary Tree
2013-04-28 19:22 by 张汉生, 163 阅读, 0 推荐, 收藏, 编辑
摘要：题目描述：点击此处/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: int maxInt(int a, int b){ return a >= b ? a : b; } int maxDepth(TreeNode *root) { ... 阅读全文
leetcode - Maximal Rectangle
2013-04-28 18:47 by 张汉生, 290 阅读, 0 推荐, 收藏, 编辑
摘要：题目描述：点击此处利用到前面的一个题目的函数。 1 class Solution { 2 public: 3 int largestRectangleArea(int hgt[], int n) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 if (n<=0) 7 return 0; 8 bool * flag = new bool[n]; 9 int i, j;10 for (i=0; i<n; i++)... 阅读全文
C++的多态性只能通过virtual关键字实现
2013-04-28 11:16 by 张汉生, 218 阅读, 0 推荐, 收藏, 编辑
摘要：今天看到C++多态性这一块，就写了一个程序验证一下。 1 #include <iostream> 2 using namespace std; 3 class Solution { 4 public:/* 5 int maximalRectangle(vector<vector<char> > &matrix) { 6 // Start typing your C/C++ solution below 7 // DO NOT write int main() function 8 return 0; 9 }*/10 };11 class A {12 阅读全文
leetcode - Longest Valid Parentheses
2013-04-26 18:52 by 张汉生, 140 阅读, 0 推荐, 收藏, 编辑
摘要：题目描述：点击此处 1 class Solution { 2 public: 3 int longestValidParentheses(string s) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 stack<int> lefts; 7 int len = s.length(); 8 int * f = new int [len]; 9 int rlt = 0;10 int i ;11 for (... 阅读全文
leetcode - Longest Substring Without Repeating Characters
2013-04-26 16:00 by 张汉生, 183 阅读, 0 推荐, 收藏, 编辑
摘要：题目描述：点击此处 1 class Solution { 2 public: 3 int lengthOfLongestSubstring(string s) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 int rlt = 0; 7 string cur = ""; 8 int len = s.length(); 9 for (int i=0; i<len; i++){10 int j;11 ... 阅读全文
leetcode - Longest Palindromic Substring
2013-04-26 15:48 by 张汉生, 205 阅读, 0 推荐, 收藏, 编辑
摘要：题目描述：点击此处 1 class Solution { 2 public: 3 int minInt (int a, int b){ 4 return a<=b?a:b; 5 } 6 string longestPalindrome(string s) { 7 // Start typing your C/C++ solution below 8 // DO NOT write int main() function 9 string rlt = "";10 if (s.length()<=0)11 return "";12 ... 阅读全文
leetcode - Longest Consecutive Sequence
2013-04-26 15:19 by 张汉生, 212 阅读, 0 推荐, 收藏, 编辑
摘要：题目描述：点击此处这道题还是排序了，没能在O(n)的时间内解决，想了一个基于模的方法好久还没出结果，看网上都是用哈希表做得，个人不认同哈希表的访问时间为O(1)。 1 class Solution { 2 public: 3 int longestConsecutive(vector<int> &num) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 if (num.size()<=0) 7 return 0; 8 sor... 阅读全文
leetcode - Longest Common Prefix
2013-04-25 22:20 by 张汉生, 145 阅读, 0 推荐, 收藏, 编辑
摘要：题目描述：点击此处 1 class Solution { 2 public: 3 string longestCommonPrefix(vector<string> &strs) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 if (strs.size()<=0) 7 return ""; 8 vector<string>::iterator si = strs.begin(); 9 string ans = * 阅读全文