![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
文章平均质量分 74
Kayser_mhy
这个作者很懒,什么都没留下…
展开
-
LeetCode Find Minimum in Rotated Sorted Array
原题描述: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. You may assume no dupli原创 2014-11-20 15:05:38 · 373 阅读 · 0 评论 -
LeetCode Reverse Words in a String
原题描述: Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the".原创 2014-11-20 16:26:50 · 319 阅读 · 0 评论 -
LeetCode 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 the stack.to原创 2014-11-20 13:58:53 · 396 阅读 · 0 评论 -
LeetCode Binary Tree Level Order Travesal
原题描述: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 /原创 2014-11-21 18:04:14 · 371 阅读 · 0 评论 -
LeetCode: Binary Tree Zigzag Level Order Traversal
原题描述: Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example:原创 2014-11-21 19:32:00 · 374 阅读 · 0 评论 -
LeetCode Binary Tree Level Order Travesal
原题描述: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 /原创 2014-11-21 18:19:29 · 365 阅读 · 0 评论