Consider the stringsto be the infinite wraparound string of abcdefghijklmnopqrstuvwxyz , soswill look like this: ...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd.... . Now we have another ...
2016-12-07 22:25 3 6232 推薦指數：
Let's define a function `countUniqueChars(s)` that returns the number of unique characters on `s`, for example if `s = "LEETCODE"` then `"L"`, `"T ...
Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes ...
Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all ...
1.1 Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structure? 這道題讓我們判斷一個字符串 ...
題目： 給定一個字符串，找到它的第一個不重復的字符，並返回它的索引。如果不存在，則返回 -1。 Given a string, find the first non-repeating character in it and return it's index. If it doesn't ...
Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: Note: You may ...
We are given two strings, A and B. A shift on A consists of taking string A and moving the leftmost character to the rightmost position. ...
Given an array of characters, compress it in-place. The length after compression must always be ...
