2015年09月_wulinsam

原创 LeetCode_best-time-to-buy-and-sell-stock

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/class Solution {public: int maxProfit(vector<int>& prices) { int len = prices.size(); if(len == 0) return

2015-09-15 19:55:10 358

原创 LeetCode_jump-game

https://leetcode.com/problems/jump-game/思路：每走一步与当前步数比较，更新最大值，始终保持maxStep是最大的class Solution {public: bool canJump(vector<int>& nums) { int len = nums.size(),maxStep = nums[0]; for(

2015-09-15 19:27:24 249

原创 LeetCode_best-time-to-buy-and-sell-stock-ii

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ 题目意思：有个股票第i天的股价为prices[i-1]，求最多获利；贪心法思想：不从整体最优上考虑问题，仅是在某种意义上的局部最优求解。（在求解问题时总想用在当前看来是最好的方法来实现）贪心选择性质：可通过做局部最优（贪心）选择来达到全局最优解；最优子结

2015-09-15 14:05:47 420

原创 LeetCode_search-insert-position

https://leetcode.com/problems/search-insert-position/class Solution {public: int searchInsert(vector<int>& nums, int target) { int len = nums.size(); for(int i = 0;i < len;i++){

2015-09-14 13:42:12 349

原创 LeetCode_single-number

https://leetcode.com/problems/single-number/class Solution {public: int singleNumber(vector<int>& nums) { sort(nums.begin(),nums.end()); for(int i = 0;i < nums.size()-2;i+=2){

2015-09-14 12:22:33 325

原创 LeetCode_factorial-trailing-zeroes

https://leetcode.com/problems/factorial-trailing-zeroes/ 思路：求能被5整除的个数；class Solution {public: int trailingZeroes(int n) { int cnt = 0; while(n){ cnt += n/5;

2015-09-14 10:31:45 371

原创 LeetCode_intersection-of-two-linked-lists

https://leetcode.com/problems/intersection-of-two-linked-lists/题意：判断两个链表是否有公共交点；思路：先求每个链表的长度，然后把最长链表移动两个链表的长度差，然后两链表同步判断，即可求出是否有公共交点；/** * Definition for singly-linked list. * struct ListNode { *

2015-09-14 10:16:22 606

原创 LeetCode_pascals-triangle-ii

https://leetcode.com/problems/pascals-triangle-ii/ 思路：从数组最后一个计算，向前迭代；class Solution {public: vector<int> getRow(int rowIndex) { vector<int> a; vector<int> vec; for(int i =

2015-09-13 14:01:57 563

原创 LeetCode_pascals-triangle

https://leetcode.com/problems/pascals-triangle/ 解题思路：第二行起，上一行的两个数之和作为下一行的一个数；class Solution {public: vector<vector<int>> generate(int numRows) { vector<int> up(2,1); vector<int> d

2015-09-13 12:07:37 445

原创 java

1、包含一个或多个抽象方法的类本身必须被声明为抽象的。抽象方法充当着占位的角色，它们的具体实现在子类中。类即使不含抽象方法，也可以将类声明为抽象类。抽象类不能被实例化。如果将一个类声明为abstract，就不能创建这个类的对象。可以定义一个抽象类的对象变量，但它只能引用非抽象类子类的对象。

2015-09-13 12:05:27 591

原创 java_多态

package override;public class Manager extends Employee{ private int bonus; public Manager(String n,int s) { // TODO Auto-generated constructor stub super(n,s); bonus = 0;

2015-09-12 19:51:45 332

原创 LeetCode_plus-one

https://leetcode.com/problems/plus-one/ 题意：一个非负数是用数组存储的，digits[0]表示最高位，用数组加1，求最后的数组。分析：如果最高位>=10则需要另外开一个数组。。。。。。class Solution {public: vector<int> plusOne(vector<int>& digits) { int len

2015-09-12 15:24:12 325

原创 LeetCode_power-of-two

https://leetcode.com/problems/power-of-two/ 给定一个数，能否开方class Solution {public: bool isPowerOfTwo(int n) { if(n == 0) return false; while(n%2 == 0){ n /= 2;

2015-09-12 14:36:37 282

原创 LeetCode_remove-duplicates-from-sorted-array

https://leetcode.com/problems/remove-duplicates-from-sorted-array/class Solution {public: int removeDuplicates(vector<int>& nums) { if(nums.size() == 0) return 0; int v

2015-09-12 14:12:21 328

原创 LeetCode_merge-two-sorted-lists

https://leetcode.com/problems/merge-two-sorted-lists/class Solution {public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode *head,*p; if(!l1 && !l2) ret

2015-09-12 13:43:37 284

原创 LeetCode_Happy Number

原题链接：https://leetcode.com/problems/happy-number/class Solution {public: bool isHappy(int n) { if(sumDigits(n) == 1) return true; else return false; }

2015-09-11 15:57:55 282

原创 LeetCode_remove-element

原题链接：https://leetcode.com/problems/remove-element/ 题意：删除数组中与val相同的元素，并返回该数组的长度；并更新被删除后的数组。class Solution {public: int removeElement(vector<int>& nums, int val) { int index = 0; in

2015-09-11 15:41:42 297

原创 LeetCode_reverse-linked-list

原题链接：https://leetcode.com/problems/reverse-linked-list/class Solution {public: ListNode* reverseList(ListNode* head) { if(!head)//避免链表为空 return head; ListNode* pre,*cur

2015-09-11 14:39:42 348

原创 LeetCode_Implement Stack using Queues

原题链接：https://leetcode.com/problems/implement-stack-using-queues/思路：使用双端队deque列实现栈class Stack {public: deque<int> que; // Push element x onto stack. void push(int x) { que.push_fro

2015-09-11 14:17:13 342

原创 LeetCode_Implement Queue using Stacks

原题链接：https://leetcode.com/problems/implement-queue-using-stacks/思路：使用两个栈in和out模拟队列；in表示入队，out表示出队class Queue {public: // Push element x to the back of queue. stack<int> in,out; void push(

2015-09-11 13:59:04 390

原创 java笔记

1、类常量（使用static final设置类常量）定义位于main方法的外部； 2、不能使用==运算符判断字符串的相等性； 3、要检查一个字符串是否为null，可以使用if（str == null）;检查一个字符串既不是null也不是空串，可使用if（str！=null && str.length() != 0） 4、int[] a = new int[100];//创建一个可存储100个整

2015-09-10 18:21:57 288

原创 LeetCode_valid-anagram

https://leetcode.com/problems/valid-anagram/class Solution {public: bool isAnagram(string s, string t) { sort(s.begin(),s.end()); sort(t.begin(),t.end()); if(s == t) retur

2015-09-10 10:49:15 361

原创 LeetCode_climbing-stairs

原题链接：https://leetcode.com/problems/climbing-stairs/同斐波那契数列：class Solution {public: int climbStairs(int n) { int s1 = 1,s2 = 2,s3; if(n == s1) return s1; if(n == s2) retur

2015-09-10 10:07:31 410

原创 LeetCode_remove-duplicates-from-sorted-list

原题链接：https://leetcode.com/problems/remove-duplicates-from-sorted-list/思路：从链表尾部开始；class Solution {public: ListNode* deleteDuplicates(ListNode* head) { ListNode* p; if(!head)

2015-09-09 15:34:01 362

原创 LeetCode_majority-element

原题链接：https://leetcode.com/problems/majority-element/class Solution {public: int majorityElement(vector<int>& nums) { if(nums.size() <= 2) return nums.front(); sort(num

2015-09-09 11:35:51 320

原创 LeetCode_excel-sheet-column-number

原题链接：https://leetcode.com/problems/excel-sheet-column-number/思路：看成是26进制，A表示65,a表示97class Solution {public: int titleToNumber(string s) { int num = 0; int len = s.length()-1;

2015-09-09 11:04:37 356

原创 LeetCode_contains-duplicate

原题链接：https://leetcode.com/problems/contains-duplicate/class Solution {public: bool containsDuplicate(vector& nums) { set s; s.insert(nums.begin(),nums.end()); if(s.size(

2015-09-09 10:15:55 425 3

原创 LeetCode_lowest-common-ancestor-of-a-binary-search-tree

原题链接：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/class Solution {public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if(m

2015-09-09 09:32:42 332

原创 LeetCode_number-of-1-bits

原题链接：https://leetcode.com/problems/number-of-1-bits/递归解法：class Solution {public: int hammingWeight(uint32_t n) { if(n == 0) return 0; if(n % 2 == 1) re

2015-09-09 08:58:16 391

原创 LeetCode_populating-next-right-pointers-in-each-node

原题链接：https://leetcode.com/problems/populating-next-right-pointers-in-each-node/class Solution {public: void connect(TreeLinkNode *root) { queue que1,que2; TreeLinkNode *pre;

2015-09-07 20:16:37 358

原创 LeetCode_binary-tree-zigzag-level-order-traversal

原题链接：https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/class Solution {public: vector> zigzagLevelOrder(TreeNode* root) { vector> floor; vector vec,temp;

2015-09-07 19:18:31 474

原创 LeetCode_Binary Tree Level Order Traversal II

原题链接：https://leetcode.com/problems/binary-tree-level-order-traversal-ii/思路：两个队列+vector逆置class Solution {public: vector> levelOrderBottom(TreeNode* root) { vector> floor,reFloor;

2015-09-07 16:45:16 323

原创 LeetCode_binary-tree-level-order-traversal

原题链接：https://leetcode.com/problems/binary-tree-level-order-traversal/class Solution {public: vector> levelOrder(TreeNode* root) { vector> floor; vector vec; queue que1,q

2015-09-07 16:15:41 365

原创 LeetCode_Binary Tree Inorder Traversal

原题链接：https://leetcode.com/problems/binary-tree-inorder-traversal/class Solution {public: vector inorderTraversal(TreeNode* root) { vector vec; stack inStack; while(root

2015-09-07 15:30:41 311

原创 LeetCode_path-sum

原题链接：https://leetcode.com/problems/path-sum//** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val

2015-09-05 11:33:20 309

原创 LeetCode_Minimum Depth of Binary Tree

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

2015-09-05 11:08:16 313

原创 LeetCode_Balanced Binary Tree

原题链接：class Solution {public: bool isBalanced(TreeNode* root) { bool flag = true; if(!root) //空树 return true; start(root,flag); return

2015-09-04 19:23:09 282

原创 LeetCode_invert binary tree

原题链接：https://leetcode.com/problems/invert-binary-tree//** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(in

2015-09-03 23:17:07 309

原创 LeetCode_same tree

原题链接：https://leetcode.com/problems/same-tree/class Solution {public: bool isSameTree(TreeNode* p, TreeNode* q) { bool flag = true; compareTree(p,q,flag); return flag;

2015-09-03 20:56:22 385 1

原创 LeetCode_delete-node-in-a-linked-list

原题链接：https://leetcode.com/problems/delete-node-in-a-linked-list//** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x),

2015-09-03 17:28:59 271

拦截器spring mvc

《游戏开发技术》遵循路径走

C++example

关于string和char的程序，求解~?为什么运行不通过