- 博客(4)
- 资源 (1)
- 收藏
- 关注
原创 【LeetCode 155】Min Stack
注:七月在线听课笔记Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. 实现一个带最小值操作的栈。 push(x) -- Push element x onto stack. pop() -- Removes the element on top of t...
2018-02-21 14:29:40 242
原创 【LeetCode 394】Decode String
注:七月在线听课笔记s = "3[a]2[bc]", return "aaabcbc". s = "3[a2[c]]", return "accaccacc". s = "2[abc]3[cd]ef", return "abcabccdcdcdef".参考代码有些问题,先记录下来,回头再思考。class Solution { public: string decodeString(
2018-02-21 13:30:07 284
原创 【LeetCode 152】Maximum Product Subarray
注:七月在线课后作业Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the larg...
2018-02-20 14:37:45 345
原创 【LeetCode 53】 Maximum Subarray
注:七月在线听课笔记53:最大子数组和Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray ...
2018-02-20 14:08:22 219
中文情感分析语料整理
2018-08-13
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人