摘要:
Write a method anagram(s,t) to decide if two strings are anagrams or not. Write a method anagram(s,t) to decide if two strings are anagrams or not. Wr 阅读全文
摘要:
Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrenc 阅读全文
摘要:
Give you an integer matrix (with row size n, column size m),find the longest increasing continuous subsequence in this matrix. (The definition of the 阅读全文
摘要:
Give an integer array,find the longest increasing continuous subsequence in this array. An increasing continuous subsequence: Can be from right to lef 阅读全文
摘要:
There are n coins with different value in a line. Two players take turns to take one or two coins from left side until there are no more coins left. T 阅读全文
摘要:
Given a set of words without duplicates, find all word squares you can build from them. A sequence of words forms a valid word square if the kth row a 阅读全文
摘要:
Given an integer n, return the number of trailing zeroes in n!. Example 1: Input: 3 Output: 0 Explanation: 3! = 6, no trailing zero. Example 2: Input: 阅读全文
摘要:
Write a function that add two numbers A and B. You should not use + or any arithmetic operators. There is no need to read data from standard input str 阅读全文
摘要:
This blog talks about using dynamic programming to solve the famous 0/1 back pack (knapsack) and its variant problems. BackPack I Given n items with s 阅读全文
摘要:
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 messag 阅读全文