fddlc专题

#力扣 LeetCode1736. 替换隐藏数字得到的最晚时间 @FDDLC

题目描述： https://leetcode-cn.com/problems/latest-time-by-replacing-hidden-digits/ 自测用例： "2?:?0""0?:3?""1?:22""??:??""??:1?""??:?1""?2:??""1?:??""2?:??""0?:??" Java代码： class Solution

#力扣：2315. 统计星号@FDDLC

2315. 统计星号 - 力扣（LeetCode）一、Java class Solution {public int countAsterisks(String s) {int cnt = 0;boolean flag = true;for(char c: s.toCharArray()) {if(c == '|') flag = !flag;else if(c == '*' && flag)

#力扣：2315. 统计星号@FDDLC

2315. 统计星号 - 力扣（LeetCode）一、Java class Solution {public int countAsterisks(String s) {int cnt = 0;boolean flag = true;for(char c: s.toCharArray()) {if(c == '|') flag = !flag;else if(c == '*' && flag)

#力扣：LCP 01. 猜数字@FDDLC

LCP 01. 猜数字 - 力扣（LeetCode）一、Java class Solution {public int game(int[] guess, int[] answer) {int cnt=0;for(int i=0;i<3;i++){if(guess[i]==answer[i])cnt++;}return cnt;}}

#力扣：2413. 最小偶倍数@FDDLC

2413. 最小偶倍数 - 力扣（LeetCode）一、Java class Solution {public int smallestEvenMultiple(int n) {return n%2==0?n:n*2;}}

#力扣：面试题 02.03. 删除中间节点@FDDLC

面试题 02.03. 删除中间节点 - 力扣（LeetCode）一、Java /*** Definition for singly-linked list.* public class ListNode {* int val;* ListNode next;* ListNode(int x) { val = x; }* }*/class Solution {pu

#力扣：1920. 基于排列构建数组@FDDLC

1920. 基于排列构建数组 - 力扣（LeetCode）一、Java class Solution {public int[] buildArray(int[] nums) {int[] ans = new int[nums.length];for (int i = 0; i < ans.length; i++) {ans[i] = nums[nums[i]];}return ans;

#力扣：2651. 计算列车到站时间@FDDLC

2651. 计算列车到站时间 - 力扣（LeetCode）一、Java class Solution {public int findDelayedArrivalTime(int arrivalTime, int delayedTime) {return (arrivalTime+delayedTime)%24;}}

#力扣：2769. 找出最大的可达成数字@FDDLC

2769. 找出最大的可达成数字 - 力扣（LeetCode）一、Java class Solution {public int theMaximumAchievableX(int num, int t) {return num + 2*t;}}

#力扣：771. 宝石与石头@FDDLC

771. 宝石与石头 - 力扣（LeetCode）一、Java class Solution {public int numJewelsInStones(String jewels, String stones) {int[] isJewel = new int['z' + 1];for (int i = jewels.length() - 1; i >= 0; i--) isJewel[j

#力扣：2894. 分类求和并作差@FDDLC

2894. 分类求和并作差 - 力扣（LeetCode）一、Java class Solution {public int differenceOfSums(int n, int m) {return (1+n)*n/2-n/m*(m+n/m*m)/2;}} 二、C++ class Solution {public:int differenceOfSums(int n, int m)

#力扣：21. 合并两个有序链表@FDDLC

21. 合并两个有序链表一、Java class Solution {public ListNode mergeTwoLists(ListNode list1, ListNode list2) {if (list1 == null) return list2;if (list2 == null) return list1;if (list1.val < list2.val) {list1

#力扣：LCR 182. 动态口令@FDDLC

LCR 182. 动态口令一、Java class Solution {public String dynamicPassword(String password, int target) {return password.substring(target) + password.substring(0, target);}} 二、C++ #include <string>usi

#力扣：206. 反转链表@FDDLC

206. 反转链表一、Java class Solution {public ListNode reverseList(ListNode head) {if (head == null) return null;ListNode pre = null, cur = head, next = head.next;while (next != null) {cur.next = pre;pr

#JavaScript教程：循环遍历@FDDLC

一、普通的for循环（当然还有while循环和do while循环）二、for of 遍历三、for in 遍历四、forEach 五、map方法六、reduce方法输出：543 七、filter方法八、some方法

#力扣：136. 只出现一次的数字@FDDLC

136. 只出现一次的数字 - 力扣（LeetCode）一、Java class Solution {public int singleNumber(int[] nums) {int ans = 0;for(int num: nums) ans ^= num;return ans;}} 二、C++ class Solution {public:int singleNumber(vec

#力扣：344. 反转字符串@FDDLC

344. 反转字符串一、Java class Solution {public void reverseString(char[] s) {for (int l = 0, r = s.length - 1; l < r; l++, r--) {s[l] ^= s[r];s[r] ^= s[l];s[l] ^= s[r];}}} 二、C++ #include <vector>usi

#力扣：26. 删除有序数组中的重复项@FDDLC

26. 删除有序数组中的重复项一、Java class Solution {public int removeDuplicates(int[] nums) {int l = 0;for (int i = 0; i < nums.length; nums[l++] = nums[i++]) {while (i + 1 < nums.length && nums[i] == nums[i +

#力扣：14. 最长公共前缀@FDDLC

14. 最长公共前缀一、Java class Solution {public String longestCommonPrefix(String[] strs) {for (int l = 0; ; l++) {for (int i = 0; i < strs.length; i++) {if (l >= strs[i].length() || strs[i].charAt(l) !=

#力扣：14. 最长公共前缀@FDDLC

14. 最长公共前缀一、Java class Solution {public String longestCommonPrefix(String[] strs) {for (int l = 0; ; l++) {for (int i = 0; i < strs.length; i++) {if (l >= strs[i].length() || strs[i].charAt(l) !=

#力扣：13. 罗马数字转整数@FDDLC

13. 罗马数字转整数一、Java import java.util.HashMap;class Solution {public int romanToInt(String s) {HashMap<Character, Integer> m = new HashMap<>() {{put('I', 1);put('V', 5);put('X', 10);put('L', 50);put

#力扣：70. 爬楼梯@FDDLC

70. 爬楼梯一、Java class Solution {public int climbStairs(int n) { // f(1)=1, f(2)=2, f(3)=3, f(4)=5, f(0)=1int pre = 1, cur = 1;for (int i = 2; i <= n; i++) {cur += pre;pre = cur - pre;}return cur;}