- 博客(3)
- 收藏
- 关注
原创 Given two (dictionary) words as Strings, determine if they are isomorphic
Given two (dictionary) words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remappedto get the second word. Remapping a letter mean
2014-10-30 09:37:42 467
原创 输出整数分解的全部解,解要从大到小的输出
输出整数分解的全部解,解要从大到小的输出Example:input: n = 12output:12*16*24*33*2*2
2014-10-30 07:14:49 907
原创 Return if string t contains all chars in s
bool isSubsetOf(const string& s, const string& t){ if(s.length() > t.length()) return false; vector table(256,0); int cur = 0; for(int i=0;i<s.length();++i) { if(table[s[i]] > 0) // if the
2014-10-30 07:12:41 453
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人