class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> v;
v.resize(2);
map<int,int> m;
for(int i =0;i<nums.size();i++)
{
if(m.count(target-nums[i]) > 0)
{
v[0] = m[target-nums[i]];
v[1] = i;
break;
}
m[nums[i]] = i;
}
return v;
}
};
class Solution {
public:
bool isPalindrome(int x) {
if(x<0) return false;
if(x<10) return true;
if(x % 10 == 0) return false;
int m = 0;
while(x>m)
{
m = m * 10 + x % 10;
x = x / 10;
}
return m/10 == x || m == x;
}
};
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int n = strs.size();
if(n == 0)
{
return "";
}
int len = strs[0].size();
for(int i = 0;i<len;i++)//循环遍历第一个元素的所有字符
{
char c = strs[0][i];
for(int j = 1;j<n;j++)//拿剩余的元素同第一个元素比
{
if(i == strs[j].size() || c != strs[j][i])//如果剩余的元素长度不够了或者与第一个元素的字符不同了
{
return strs[0].substr(0,i);
}
}
}
return strs[0];
}
};