LeetCode 7 -- String to Integer (atoi)
摘要：
Implementatoito convert a string to an integer.转换很简单，唯一的难点在于需要开率各种输入情况，例如空字符串，含有空格，字母等等。另外需在写的时候注意细节问题，完成后需要反复调试，整合。 1 public class Solution { 2 p... 阅读全文
LeetCode 6 -- ZigZag Conversion
摘要：
The string"PAYPALISHIRING"is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font fo... 阅读全文
LeetCode 5 -- Longest Palindromic Substring
摘要：
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa... 阅读全文
LeetCode 4 -- Median of Two Sorted Arrays
摘要：
There are two sorted arraysnums1andnums2of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should... 阅读全文
LeetCode 3 -- Longest Substring Without Repeating Characters
摘要：
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文
Java实现字符串反转的8种方法
摘要：
1 /** 2 * 3 */ 4 package com.wsheng.aggregator.algorithm.string; 5 6 import java.util.Stack; 7 8 /** 9 * 8 种字符串反转的方法, 其实可以是9种方法，第9种是... 阅读全文
LeetCode 2 -- Add Two Numbers
摘要：
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ... 阅读全文
LeetCode 1 -- Two Sum
摘要：
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 nu... 阅读全文
LeetCode189——Rotate Array
摘要：
Rotate an array ofnelements to the right byksteps.For example, withn= 7 andk= 3, the array[1,2,3,4,5,6,7]is rotated to[5,6,7,1,2,3,4].Note:Try to come... 阅读全文