leetcode 解题思路

Given a stringscontaining only lower case English lettersand the '?'character, convertallthe '?' characters into lower case letters such that the final string does not contain anyconsecutive repeatingcharacters.Youcannotmodify the non '?' charac...

Given a palindromic stringpalindrome, replaceexactly onecharacter by any lowercase English letter so that the string becomes the lexicographically smallest possible string thatisn'ta palindrome.After doing so, return the final string. If there is n...

Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1.For example, with A = "abcd" and B = "cdabcdab".Return 3, because by repeating A three times (“abcdabcdabc

Given a list ofuniquewords, find all pairs ofdistinctindices(i, j)in the given list, so that the concatenation of the two words, i.e.words[i] + words[j]is a palindrome.Example 1:Input: ["abcd","dcba","lls","s","sssll"]Output: [[0,1],[1,0],[3,...

Write a function to check whether an input string is a valid IPv4 address or IPv6 address or neither.IPv4addresses are canonically represented in dot-decimal notation, which consists of four decimal numbers, each ranging from 0 to 255, separated by dots.

SandTare strings composed of lowercase letters. InS, no letter occurs more than once.Swas sorted in some custom order previously. We want to permute the characters ofTso that they match the order thatSwas sorted. More specifically, ifxoccurs b...

A sentenceSis given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.We would like to convert the sentence to "Goat Latin"(a made-up language similar to Pig Latin.)The rules of Goat Latin are as foll...

Given a strings, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.Example 1:Input: "aacecaaa"Output: "aaacecaaa"Example 2:.

Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase Engli...

To some stringS, we will perform somereplacementoperations that replace groups of letters with new ones (not necessarily the same size).Each replacement operation has3parameters: a starting ind...

You are given a string representing an attendance record for a student. The record only contains the following three characters:'A': Absent. 'L': Late. 'P': Present.A student could be rewarded...

You are given a string representing an attendance record for a student. The record only contains the following three characters:'A': Absent. 'L': Late. 'P': Present.A student could be rewarded...

Given a stringsconsisting only ofletters'a'and'b'. In a single step you can remove onepalindromicsubsequencefroms.Return the minimum number of steps to make the given string empty.A stri...

思路1：面试的时候可以自己写process methodclass Solution { public int numUniqueEmails(String[] emails) { if(emails == null || emails.length == 0) { return 0; } HashSet&...

Given twostringsSandT,return if they are equal when both are typed into empty text editors.#means a backspace character.Example 1:Input: S = "ab#c", T = "ad#c"Output: trueExplanation: Bo...

You are given a license key represented as a string S which consists only alphanumeric character and dashes. The string is separated into N+1 groups by N dashes.Given a number K, we would want to re...

Given a string(Given in the way of char array), a right offset and a left offset, rotate the string by offset in place.(left offest represents the offset of a string to the left,right offest represent...

Given a string s, return the last substring of s in lexicographical order.ExampleExample 1:Input: "abab"Output: "bab"Explanation: The substrings are ["a", "ab", "aba", "abab", "b", "ba", "bab...

Given a string(Given in the way of char array) and an offset, rotate the string by offsetin place. (rotate from left to right).ExampleExample 1:Input: str="abcdefg", offset = 3Output: str = "...

DescriptionImplementstrStrfunction in O(n + m) time.strStrreturn the first index of the target string in a source string. The length of the target string ismand the length of the source strin...

Given two strings S and T, determine if they are both one edit distance apart.思路：可以用edit distance 来计算最小值，但是time out现在用我看到的一种解法，recursion来做。用i, j 两个指针，从左边扫到右边，两个一起走。s.charAt(i) != t.charAt(j

Find the length of the longest substringTof a given string (consists of lowercase letters only) such that every character inTappears no less thanktimes.Example 1:Input:s = "aaabb", k =

Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".思路：首先将原来string split成 string array，然后倒着再连接起来。注意： 用stringbuilder，avoid c...

Write a function that takes a string as input and returns the string reversed.Example 1:Input: "hello"Output: "olleh"Example 2:Input: "A man, a plan, a canal: Panama"Output: "amanaP :lana...

Design an algorithm to encodea list of stringstoa string. The encoded string is then sent over the network and is decoded back to the original list of strings.Machine 1 (sender) has the functio

You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without

Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.For exampl

Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is9534330.Note: The result may be very

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is

You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take turns to flip two consecutive "++" into "--". Th

Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.Note:You may assume t...

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 case

Given an input string, reverse the string word by word. A word is defined as a sequence of non-space characters.The input string does not contain leading or trailing spaces and the words are alway

Given a string, determine if a permutation of the string could form a palindrome.For example,"code"-> False,"aab"-> True,"carerac"-> True.public class Solution { public boolean ca

Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.Show TagsHave you m

Given a rows x cols screen and a sentence represented by a list of words, find how many times the given sentence can be fitted on the screen.Note:A word cannot be split into two lines.The or

string 有多少palindrome substring。exp: 'aba' 返回4 , 'abba' 返回6public class CountPalindrome { public int countPalindrome(String str){ if(str == null || str.length() == 0) return 0; int count =

Given an array of words and a lengthL, format the text such that each line has exactlyLcharacters and is fully (left and right) justified.You should pack your words in a greedy approach; that is,

Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguous.

All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.Write