LeetCode 数据结构基础 Day6 Java

415. 字符串相加

问题描述:

 代码:

class Solution {
    public String addStrings(String num1, String num2) {
        int p1=num1.length()-1;
        int p2=num2.length()-1;
        StringBuffer ans = new StringBuffer();
        int add=0;
        while(p1>=0||p2>=0||add!=0){
            int i=p1>=0?num1.charAt(p1)-'0':0;
            int j=p2>=0?num2.charAt(p2)-'0':0;
            int res=i+j+add;
            add=res/10;
            ans.append(res%10);
            p1--;
            p2--;
        }
        ans.reverse();
        return ans.toString();

    }
}

思路:

 409. 最长回文串

问题描述:

 代码:

class Solution {
    public int longestPalindrome(String s) {
         Map<Character,Integer> hx = new HashMap<>();
         int sum=0;
         int j=0;
         char []ss=s.toCharArray();
         for(char num:ss){
             int count=hx.getOrDefault(num,0)+1;
             hx.put(num,count);
         }
         for(int i=0;i<ss.length;i++){
             if(hx.get(ss[i])<=2){
                 if(hx.get(ss[i])%2==0&&hx.get(ss[i])!=0){
                 sum=sum+2;
                 int count=hx.get(ss[i])-2;
                 hx.put(ss[i],count);
                 }
             }else{
                 sum=sum+2;
                 int count=hx.get(ss[i])-2;
                 hx.put(ss[i],count);
             }
             
         }
         return sum==ss.length?sum:sum+1;
    }
}

思路:hashmap  yyds