- 博客(32)
- 资源 (35)
- 收藏
- 关注
原创 [leetcode] Flatten Binary Tree to Linked List
使用递归,把左子树插入到根he/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };
2014-08-16 16:13:55 424
原创 [leetcode] Word Break
Word Breakclass Solution {public: bool wordBreak(string s, unordered_set &dict) { //长度为n的字符串有n+1个隔板 //开辟s.size()+1大小的vector,并初始化为false; vector fun(s.size()+1,f
2014-08-15 16:55:55 441
原创 [leetcode] Evaluate Reverse Polish Notation
Evaluate Reverse Polish Notation
2014-08-14 00:01:07 473
原创 [leetcode] Valid Palindrome
class Solution {public: bool isPalindrome(string s) {//只考虑字母数字,并忽略大小写 transform(s.begin(),s.end(),s.begin(),::tolower);//转为小写 auto left=s.begin(),right=prev(s.end()); whil
2014-08-13 15:32:51 399
原创 [leetcode] Remove Nth Node From End of List
Remove Nth Node From End of List
2014-08-12 00:31:47 379
原创 判断单链表是否有环及找环的入口
#include using namespace std;typedef struct node{ int val; struct node *next;}node,*LinkList;bool isExistsLoop(LinkList L){//false有环 LinkList fast,slow; fast=slow=L; while (
2014-08-06 23:55:28 590
原创 [leetcode] 3Sum Closest
3Sum Closestclass Solution {public: int threeSumClosest(vector &num, int target) { int res; int minGap=INT_MAX; sort(num.begin(),num.end());//排序 f
2014-08-02 17:07:51 426
原创 [leetcode] Maximum Depth of Binary Tree
class Solution {public: int maxDepth(TreeNode *root) { if(root==nullptr){ return 0; } return max(maxDepth(root->left),maxDepth(root->right))+1; }};
2014-08-01 23:45:07 393
原创 [leetcode] Single Number
Single Numberclass Solution {public: int singleNumber(int A[], int n) { int res=0; for(int i=0;i<n;++i){ res^=A[i]; } return res; }};
2014-08-01 10:48:53 360
原创 [leetcode] Longest Consecutive Sequence
class Solution {public: int longestConsecutive(vector &num) { unordered_map used; for(auto i:num){ used[i]=false; } int longest=0;
2014-08-01 10:46:27 591
weka 连数据库使用的jar包
2013-04-13
Windows 2003(XP)下安装配置Apache2.2.17+PHP5.2.17+mysql5.5.11服务器
2011-04-22
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人