HY_87645的专栏

public String reverseWords(String s) { if(s.equals(""))return ""; Stack stack = new Stack();StringBuilder results = new StringBuilder();for(String str : s.split(" ")){ if(str.equals("")) continue;stac

题目：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.yuandai

题目：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.源代码：public class Solution { public TreeNode sortedArrayToBST(int[] num) { if(num

题目：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" 

题目：Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

题目：   Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.注意：当root的

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multipl

题目：Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the

Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.思路：首先找到

不使用额外的空间，判断一个给定的数字是否为回文

如题，这里的字符串不止是

Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ca

Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, w

Insertion Sort List ，即用插入的方法排序

3. Sort ListSort a linked list in O(n log n) time using constant space complexity.

题目：Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional eleme