瞬间

力扣每日一题

题目：[1410. HTML 实体解析器](https://leetcode.cn/problems/html-entity-parser/description/)

日期：2023-11-23

用时：4 m 57 s

时间：34ms

内存：42.68MB

代码：

class Solution {
    public String entityParser(String text) {
        return text.replaceAll(""", "\"")
        .replaceAll("'","'")
        .replaceAll(">",">")
        .replaceAll("&lt;","<")
        .replaceAll("&frasl;","/")
        .replaceAll("&amp;","&");
    }
}

力扣每日一题

题目：[2216. 美化数组的最少删除数](https://leetcode.cn/problems/minimum-deletions-to-make-array-beautiful/description/)

日期：2023-11-21

用时：11 m 23 s

时间：3ms

内存：54.23MB

代码：

class Solution {
    public int minDeletion(int[] nums) {
        int cnt = 0;
        for(int i=0;i<nums.length;i++){
            if((i - cnt) % 2 == 0 && i + 1 < nums.length && nums[i] == nums[i + 1]){
                cnt +=1;
            }
        }
        return (nums.length-cnt)%2==0?cnt:cnt+1;
    }
}

力扣每日一题

题目：[2760. 最长奇偶子数组](https://leetcode.cn/problems/longest-even-odd-subarray-with-threshold/description/)

日期：2023-11-16

用时：1 m 33 s

时间：4ms

内存：41.76MB

代码：

class Solution {
    public int longestAlternatingSubarray(int[] nums, int threshold) {
        int max = 0;
        int cnt = 0;
        for(int i=0;i<nums.length;i++){
            if(cnt==0){
                if(nums[i]%2==0&&nums[i]<=threshold){
                    cnt++;
                }
            }else {
                if(i>0&&nums[i] % 2 != nums[i - 1] % 2&&nums[i]<=threshold){
                    cnt++;
                }else{
                    max = Math.max(max,cnt);
                    if(nums[i]%2==0&&nums[i]<=threshold){
                        cnt=1;
                    }else{
                        cnt=0;
                    }
                }
            }
        }
        return Math.max(max,cnt);
    }
}

力扣每日一题，用时: 1 m 33 s

题目：[2656. K 个元素的最大和](https://leetcode.cn/problems/maximum-sum-with-exactly-k-elements/description/)

代码：

class Solution {
    public int maximizeSum(int[] nums, int k) {
        Arrays.sort(nums);
        int sum = 0;
        int num = nums[nums.length-1];
        for(int i=0;i<k;i++){
            sum+=num;
            num++;
        }
        return sum;
    }
}

力扣每日一题，花费时间00:49:28

记录一下代码片段，通过Python批量修改图片名，改为IMG_年月日_时分秒.原始后缀（例如：IMG_20231111_170415.jpeg），代码是pyhton3.10

import os
import glob
import exifread


# 获取照片的拍摄时间
def get_photo_taken_time(image_path):
    with open(image_path, 'rb') as f:
        tags = exifread.process_file(f)
        if 'EXIF DateTimeOriginal' in tags:
            taken_time = tags['EXIF DateTimeOriginal']
            return taken_time
        else:
            return None


def solution():
    # 获取当前时间并格式化为年月日时分秒毫秒

    # 设置照片所在的文件夹路径
    folder_path = "C:\\Users\\Administrator\\Pictures\\图片"

    # 获取文件夹中的所有照片文件
    photo_files = glob.glob(os.path.join(folder_path, "*"))

    # 遍历照片文件并重命名
    for photo in photo_files:
        creation_time_stamp = get_photo_taken_time(photo)
        if creation_time_stamp is None:
            continue
        formatted_time = "IMG_" + creation_time_stamp.values.replace(':', '').replace(' ', '_')
        file_name, file_ext = os.path.splitext(photo)
        new_file_name = f"{formatted_time}{file_ext}"
        new_file_path = os.path.join(folder_path, new_file_name)
        os.rename(photo, new_file_path)

    print("照片重命名完成！")


if __name__ == "__main__":
    solution()

嘿嘿

测试

2023年2月了，开启力扣每日一题！

测试测试