- 博客(2)
- 收藏
- 关注
RSS订阅转载 17. Letter Combinations of a Phone Number
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is give...
2019-07-21 19:43:04
101
转载 14. Longest Common Prefix
M1: class Solution { public: string longestCommonPrefix(vector<string>& strs) { int num=strs.size(); if(num==0) return ""; if(num==1) return strs[0]; int ...
2019-07-21 17:01:54
79
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人