- 博客(2)
- 收藏
- 关注
RSS订阅原创 [LeetCode-230]Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.Follow up: What if the BST is modif
2015-12-27 14:10:03
347
原创 [LeetCode-283] Move Zeroes
[LeetCode-283]Move Zeroes写在前面：待补充。。。Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1,
2015-12-24 00:32:57
491
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人