高阶面试-hw算法整理

慢慢慢时光

于 2024-07-19 08:16:25 发布

阅读量76

点赞数 1

文章标签：面试算法

本文链接：https://blog.csdn.net/wjl31802/article/details/140538821

版权

坚持最近一个星期把每道题搞熟悉

文章目录

1154一年中的第几天

public int dayOfYear(String date) {
	// format YYYY-MM-DD
	int year = Integer.parseInt(date.substring(0, 4));
	int month = Integer.parseInt(date.substring(5, 7));
	int day = Integer.parseInt(date.substring(8));
	int[] daysOfMonthList = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	// 闰月
	if (year % 400 == 0 || (year % 4 == 0 && year % 100 != 0)) {
	daysOfMonthList[1]++;
	}
	int daysBeforeThisMonth = 0;
	if (month > 1){
	for (int i = 0; i < month - 1; i++) {
	daysBeforeThisMonth += daysOfMonthList[i];
	}
	}
	return day+daysBeforeThisMonth;
}

125. 验证回文串

class Solution {
    public boolean isPalindrome(String s) {
        int n = s.length();
        int left = 0;
        int right = n-1;
        while(left < right){
            while(left < right && !Character.isLetterOrDigit(s.charAt(left))){
                left++;
            }
            while(left < right && !Character.isLetterOrDigit(s.charAt(right))){
                right--;
            }

            if(Character.toLowerCase(s.charAt(left)) != Character.toLowerCase(s.charAt(right))){
                return false;
            }
            left++;
            right--;
        }
        return true;
    }
}

344. 反转字符串

class Solution {
    public void reverseString(char[] s) {
        // 双指针
        int left = 0;
        int right = s.length-1;
        while(left < right){
            char temp = s[left];
            s[left] = s[right];
            s[right] = temp;
            left++;
            right--;
        }
    }
}

20. 有效的括号

class Solution {
    public boolean isValid(String s) {
        // map {} 栈
        // check
        if(s.isEmpty()){
            return true;
        }

        Map<Character,Character> map = new HashMap();
        map.put(']','[');
        map.put('}','{');
        map.put(')','(');

        Stack<Character> stack = new Stack();
        for(Character c: s.toCharArray()){
            if(map.containsKey(c)){
                // 说明有括号
                Character topElement = stack.isEmpty()?'#':stack.pop();
                if(map.get(c) != topElement){
                    return false;
                }
            }else{
                stack.push(c);
            }
        }
        return stack.isEmpty();
    }
}

392. 判断子序列

class Solution {
    public boolean isSubsequence(String s, String t) {
        // 贪心 双指针
        int n = s.length();
        int m = t.length();
        int i =0, j=0;
        while(i<n && j<m){
            if(s.charAt(i) == t.charAt(j)){
                i++;
            }
            j++;
        }
        return i == n;
    }
}

409. 最长回文串

class Solution {
    public int longestPalindrome(String s) {
        // hash 偶数++ 奇数放中间只能1个
        Map<Character,Integer> counter = new HashMap();
        for( int i = 0; i< s.length(); i++){
            counter.merge(s.charAt(i),1,(a,b)->(a+b));
        }
        // 统计构造回文串的最大长度
        int res = 0, odd = 0 ;
        for(Map.Entry<Character,Integer> kv: counter.entrySet()){
            // 当前字符出现次数向下取偶数，并计入res
            int count = kv.getValue();
            int rem = count % 2;
            res += count - rem;

            // 如果当前字符出现次数是奇数，将odd置位1
            if(rem == 1){
                odd = 1;
            }
        }
        return res+odd;
    }
}

859. 亲密字符串

class Solution {
    public boolean buddyStrings(String s, String goal) {
        //check len
        if (s.length() != goal.length()){
            return false;
        }

        // equal
        if (s.equals(goal)){
            int[] count = new int[26];
            for (int i = 0; i < s.length(); i++) {
                int assicCount = s.charAt(i)-'a';
                count[assicCount]++;//对应字母的频率
                if (count[assicCount] > 1){
                    // 有重复，只要换重复的就一定相等
                    return true;
                }
            }
            return false;
        }else {
            // first second
            int first = -1;
            int second = -1;
            for (int i = 0; i < s.length(); i++) {
                // 只能有两个相同位置的字符不一样
                if (s.charAt(i) != goal.charAt(i)){
                    if (first==-1){
                        first = i;
                    }else if (second==-1){
                        second = i;
                    }else {
                        // 超过两个
                        return false;
                    }
                }
            }
            return (second != -1 && s.charAt(first) == goal.charAt(second) && s.charAt(second) == goal.charAt(first));
        }
    }
}

14. 最长公共前缀

class Solution {
    public String longestCommonPrefix(String[] strs) {
        // check
        if(strs.length ==0){
            return "";
        }

        // 先排序 再比较头尾
        Arrays.sort(strs);
        int n = strs.length;
        String ans = "";
        for(int i = 0; i< strs[0].length();i++){
            if(strs[0].charAt(i) == strs[n-1].charAt(i)){
                ans += strs[0].charAt(i);
            }else{
                break;
            }
        }
        return ans;
    }
}

1694. 重新格式化电话号码

class Solution {
    public String reformatNumber(String number) {
        StringBuilder digits = new StringBuilder();
        for(int i = 0; i < number.length(); i++){
            char c = number.charAt(i);
            if(Character.isDigit(c)){
                digits.append(c);
            }
        }

        int n = digits.length();
        int currPt = 0;
        StringBuilder ans = new StringBuilder();
        while(n > 0){
            if(n > 4){
                ans.append(digits.substring(currPt,currPt+3)+"-");
                n -=3;
                currPt += 3;
            }else{
                if(n==4){
                    ans.append(digits.substring(currPt,currPt+2)+"-"+digits.substring(currPt+2,currPt+4));
                }else {
                    ans.append(digits.substring(currPt,currPt+n));
                }
                break;
            }
        }
        return ans.toString();
    }
}