2018年11月11日

[Leetcode 739]*还有几天会升温 Daily Temperatures

摘要：【题目】 Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a 阅读全文

posted @ 2018-11-11 17:38 alau 阅读(141) 评论(0) 推荐(0) 编辑

[Leetcode 135]糖果分配 Candy

摘要：【题目】 There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the followi 阅读全文

posted @ 2018-11-11 16:35 alau 阅读(208) 评论(0) 推荐(0) 编辑

2018年11月9日

[Leetcode 101]判断对称树 Symmetric Tree

摘要：【题目】 Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is s 阅读全文

posted @ 2018-11-09 18:17 alau 阅读(132) 评论(0) 推荐(0) 编辑

[Leetcode 100]判断二叉树相同 Same Tree

摘要：【题目】判断二叉树是否相同。【思路】 check函数。 p==null并且q==null，返回true;（两边完全匹配） p==null或q==null，返回false;(p、q其中一方更短) p.val==q.val，值相同，继续迭代向左向右遍历check(p.left,q.left)&&ch 阅读全文

posted @ 2018-11-09 17:48 alau 阅读(113) 评论(0) 推荐(0) 编辑

[Leetcode 392]判断子序列 Is Subsequence

摘要：【思路】判断s是否为t的子串，所以length(s)<=length(t)。于是两个指针，一次循环。将s、t转换为数组p1、p2。 i为过程中s的匹配长度。 i=0空串，单独讨论返回true。当i=p1.length-1时返回true，否则循环结束返回false。【代码】【举例】阅读全文

posted @ 2018-11-09 16:48 alau 阅读(116) 评论(0) 推荐(0) 编辑

[Leetcode 376]摇摆序列 Wiggle Subsequence

摘要：【题目】 A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. 阅读全文

posted @ 2018-11-09 16:31 alau 阅读(114) 评论(0) 推荐(0) 编辑

[leetcode整理]

摘要：简单 leetcode164 Maximum Gap sort两次有参考 330 Patching Array 98 Validate Binary Search Tree BFS 60 Subsets II [done] 435 non-overlapping 455. Assign Cooki 阅读全文

posted @ 2018-11-09 16:10 alau 阅读(157) 评论(0) 推荐(0) 编辑

[整理]Kadane算法

摘要：仅能操作一次时，需每次观察是否有为负情况置零。多次操作时，仅需判断是否后者大于前者。 leetcode 53、121、122 【代码】 class Solution { public int maxSubArray(int[] nums) { int sum=Integer.MIN_VALUE; i 阅读全文

posted @ 2018-11-09 08:35 alau 阅读(466) 评论(0) 推荐(0) 编辑

[Leetcode 122]买股票II Best Time to Buy and Sell Stock II

摘要：【题目】 Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may c 阅读全文

posted @ 2018-11-09 08:26 alau 阅读(96) 评论(0) 推荐(0) 编辑

2018年11月7日

[Leetcode 881]船救人 Boats to Save People 贪心

摘要：【题目】 The i-th person has weight people[i], and each boat can carry a maximum weight of limit. Each boat carries at most 2 people at the same time, pro 阅读全文

posted @ 2018-11-07 20:02 alau 阅读(376) 评论(0) 推荐(0) 编辑

公告