西二旗的小飞飞

[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,

[LeetCode-70] Climbing StairsYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Solutio

Determine whether an integer is a palindrome. Do this without extra space.Solution[C++]:class Solution {public: bool isPalindrome(int x) { if(x < 0) return false; int t

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

A message containing letters from A-Z is being encoded to numbers using the following mapping:‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given an encoded message containing digits, determine the total number of