2016年10月_hebastast

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 274. H-Index

class Solution {public: int hIndex(vector<int>& citations) { vector<int> count(citations.size()+1,0); int l=citations.size(); if(l==0) return 0; for(int

2016-10-26 10:36:38 308

原创 268. Missing Number

class Solution {public: int missingNumber(vector<int>& nums) { vector<bool> flag(nums.size()+1,false); for(int i=0;i<nums.size();i++) { flag[nums[i]]=true;

2016-10-26 09:35:23 234

原创 264. Ugly Number II

class Solution {public: int nthUglyNumber(int n) { if(n<=0) return false; if(n==1) return 1; int t2,t3,t5; t2=t3=t5=0; vector<int> n

2016-10-25 14:21:49 249

原创 263. Ugly Number

class Solution {public: bool isUgly(int num) { for(int i=2;i<6&&num;i++) { while(num%i==0) num/=i; } return num==1; }};

2016-10-25 12:54:07 248

原创 260. Single Number III

class Solution {public: vector<int> singleNumber(vector<int>& nums) { unordered_map<int,int> m; for(int i=0;i<nums.size();i++) { m[nums[i]]++; }

2016-10-24 11:56:44 245

原创 258. Add Digits

class Solution {private: int addhelper(int num) { int sum=0; while(num) { sum+=(num%10); num/=10; } return sum; }public:

2016-10-24 11:16:55 267

原创 257. Binary Tree Paths

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class

2016-10-24 10:55:51 257

原创 228. Summary Ranges

class Solution {public: vector<string> summaryRanges(vector<int>& nums) { vector<string> ret; if(nums.size()==0) return ret; if(nums.size()==1) {

2016-10-24 10:22:59 216

原创 227. Basic Calculator II

*class Solution {public: int calculate(string s) { stack<int> nums; int temp; char flag='+'; for(int i=0;i<s.size();i++) { char c=s[i];

2016-10-23 11:56:20 286

原创 224. Basic Calculator

class Solution {public: int calculate(string s) { stack<int> opt,ret; int result,nums,flag; result=nums=0; flag=1; for(int i=0;i<s.size();i++) { char c=s[i];

2016-10-21 14:51:23 272

原创 225. Implement Stack using Queues

class Stack {private: queue<int> q;public: // Push element x onto stack. void push(int x) { q.push(x); for(int i=0;i<q.size()-1;i++) { q.push(q.front(

2016-10-21 13:37:56 268

原创 222. Count Complete Tree Nodes

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class

2016-10-20 11:58:24 271

原创 219. Contains Duplicate II

class Solution {public: bool containsNearbyDuplicate(vector<int>& nums, int k) { unordered_set<int> s; if(k<0) return false; if(k>=nums.size()) k=nu

2016-10-20 10:51:42 285

原创 217. Contains Duplicate

class Solution {public: bool containsDuplicate(vector<int>& nums) { map<int,int>m; for(int i=0;i<nums.size();i++) { m[nums[i]]++; } for(auto it=

2016-10-20 10:11:15 281

原创 216. Combination Sum III

class Solution {private: void search(vector<vector<int>> &ret,vector<int> &cur,int start,int k,int target) { if(cur.size()>=k) return; for(int i=start;i<=9;i++)

2016-10-20 09:34:28 284

原创 215. Kth Largest Element in an Array

class Solution {private: void swap(vector<int>&nums,int i,int j) { int temp=nums[i]; nums[i]=nums[j]; nums[j]=temp; } int quickSelect(vector<int>&nums,int l,int

2016-10-19 21:41:50 267

原创 House Robber II

class Solution {private: int robHelp(vector<int> & nums,int start,int end) { if(end-start+1==1) return nums[start]; if(end-start+1==2) return max(nums[s

2016-10-19 10:10:14 250

原创 211. Add and Search Word - Data structure design

using namespace std;struct Trie{ bool isword; Trie *next[26]; Trie() { isword=false; memset(next,NULL,sizeof(Trie*)*26); }};class WordDictionary {private: Tr

2016-10-18 18:21:25 342

原创 212. Word Search II

class Solution {private: struct TrieNode{ string s=""; TrieNode * next[26]; TrieNode(){ s=""; memset(next,0,sizeof(next)); } }; Trie

2016-10-17 16:55:04 252

原创 208. Implement Trie

class TrieNode {public: TrieNode *next[26]; bool isword; // Initialize your data structure here. TrieNode(bool b=false) { isword=b; memset(next,0,sizeof(next)); }}

2016-10-17 10:01:00 260

原创 209. Minimum Size Subarray Sum

class Solution {public: int minSubArrayLen(int s, vector<int>& nums) { int left=0; int right=0; int sum=0; int min_dis=INT_MAX; int n=nums.size(); w

2016-10-16 14:51:35 270

原创 210. Course Schedule II

class Solution {public: vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) { vector<vector<int>> matrix(numCourses); vector<int> indegree(numCourses,0);

2016-10-15 15:22:22 304

原创 207. Course Schedule

class Solution {public: bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) { vector<vector<bool>> matrix(numCourses,vector<bool>(numCourses,false)); vector<int>

2016-10-15 10:22:06 274

原创 205. Isomorphic Strings

class Solution {public: bool isIsomorphic(string s, string t) { set<char> mys; unordered_map<char,char> mymap; int n=s.size(); int m=t.size(); if(n!=m)

2016-10-14 10:23:21 232

原创 204. Count Primes

class Solution {public: int countPrimes(int n) { if(n<=2) return 0; if(n==3) return 1; vector<bool> flag(n,true); for(int i=2;i<n;i++)

2016-10-13 11:09:18 225

原创 203. Remove Linked List Elements

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* rem

2016-10-13 10:41:04 243

原创 202. Happy Number

class Solution {private: int mysum(int n) { int res=0; while(n) { int temp=n%10; n/=10; res+=temp*temp; } return res

2016-10-13 10:08:56 233

原创 206. Reverse Linked List

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* rev

2016-10-13 09:51:05 246

原创 200. Number of Islands

DFS解决class Solution {private: void DFS(vector<vector<char>>&grid,int x,int y)//把x,y这个位置置'0' 并dfs搜索他的四个方向只要为1都变成0 { grid[x][y]='0'; if(x>0&&grid[x-1][y]=='1') DFS(

2016-10-12 19:47:13 287

原创 198. House Robber

class Solution {public: int rob(vector<int>& nums) { int n=nums.size(); if(n==0) return 0; if(n==1) return nums[0]; vector<int> dp(n,0);//dp

2016-10-12 16:21:50 311

原创 191. Number of 1 Bits

class Solution {public: int hammingWeight(uint32_t n) { int count=0; for(int i=0;i<32;i++) { if(n&1) count++; n>>=1; }

2016-10-12 15:55:42 248

原创 199. Binary Tree Right Side View

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class

2016-10-12 15:42:24 223

原创 Facial_keypoints_deeplearning_cnn

import osimport numpy as npimport pandas as pdfrom sklearn.utils import shuffleFTRAIN='./input/training.csv'FTEST='./input/test.csv'df_train=pd.read_csv(FTRAIN)df_train['Image']=df_train['Image'].

2016-10-12 14:04:21 974

原创 190. Reverse Bits

class Solution {public: uint32_t reverseBits(uint32_t n) { uint32_t m; for(int i=0;i<32;i++) { m<<=1; m|=(n&1); n>>=1; }

2016-10-11 11:23:45 256

原创 189. Rotate Array

class Solution {private: void myreverse(vector<int> &nums,int start,int end) { while(end>start) { int temp=nums[start]; nums[start]=nums[end];

2016-10-11 11:01:59 247

原创 188. Best Time to Buy and Sell Stock IV

class Solution {private: int quicksolve(int days,vector<int>& prices) { int profit=0; for(int i=1;i<days;i++) { if(prices[i]>prices[i-1]) pr

2016-10-11 10:35:38 330

原创 DigitRecongnizer_CNN_DeepLearning

import numpy as npimport pandas as pd%matplotlib inlineimport matplotlib.pyplot as pltimport matplotlib.cm as cmfrom lasagne.layers import Conv2DLayerfrom lasagne.layers import MaxPool2DLayerfr

2016-10-10 22:16:05 600

原创 187. Repeated DNA Sequences

class Solution {public: vector<string> findRepeatedDnaSequences(string s) { unordered_map<int,int> m;//先讲string 映射成int 再进行hash 否则超内存 int hashindex=0; int len=10; in

2016-10-10 14:43:21 269

原创 179. Largest Number

class Solution {public: static bool cmp(const string &a,const string &b) { return a+b>b+a; } string largestNumber(vector<int>& nums) { vector<string> snums; for

2016-10-10 10:45:50 228