From 7e97bc3a2e6a53873b349dd7750886b9aa07be33 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E8=BD=A9=E8=BE=95=E9=BE=99=E5=84=BF?= Date: Sat, 15 Jan 2022 23:41:22 +0800 Subject: [PATCH] =?UTF-8?q?1716:=E8=AE=A1=E7=AE=97=E5=8A=9B=E6=89=A3?= =?UTF-8?q?=E9=93=B6=E8=A1=8C=E7=9A=84=E9=92=B1?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../java/contest/y2022/m1/dw/SolutionD69.java | 136 ++++++++++++++++++ .../contest/y2022/m1/week/Solution275.java | 49 +++++++ .../cn/CalculateMoneyInLeetcodeBank.java | 66 +++++++++ .../content/CalculateMoneyInLeetcodeBank.md | 37 +++++ 4 files changed, 288 insertions(+) create mode 100644 src/main/java/contest/y2022/m1/dw/SolutionD69.java create mode 100644 src/main/java/contest/y2022/m1/week/Solution275.java create mode 100644 src/main/java/leetcode/editor/cn/CalculateMoneyInLeetcodeBank.java create mode 100644 src/main/java/leetcode/editor/cn/doc/content/CalculateMoneyInLeetcodeBank.md diff --git a/src/main/java/contest/y2022/m1/dw/SolutionD69.java b/src/main/java/contest/y2022/m1/dw/SolutionD69.java new file mode 100644 index 0000000..09a7dd5 --- /dev/null +++ b/src/main/java/contest/y2022/m1/dw/SolutionD69.java @@ -0,0 +1,136 @@ +package contest.y2022.m1.dw; + +import com.code.leet.entiy.ListNode; +import com.code.leet.entiy.TwoArray; +import javafx.util.Pair; + +import java.util.*; + +public class SolutionD69 { + public static void main(String[] args) { + SolutionD69 solution = new SolutionD69(); +// System.out.println(solution.longestPalindrome(new String[]{"ll", "lb", "bb", "bx", "xx", "lx", "xx", "lx", "ll", "xb", "bx", "lb", "bb", "lb", "bl", "bb", "bx", "xl", "lb", "xx"})); + TwoArray twoArray = new TwoArray("[[1,0,0,0],[1,0,0,0],[1,0,0,0],[1,0,0,0],[1,0,0,0]]", true); + System.out.println(solution.possibleToStamp(twoArray.getArr(), 4, 3)); + } + + public String capitalizeTitle(String title) { + String[] strs = title.split(" "); + StringBuilder titleBuilder = new StringBuilder(); + for (String str : strs) { + str = str.toLowerCase(); + if (str.length() > 2) { + titleBuilder.append(str.substring(0, 1).toUpperCase()).append(str.substring(1)).append(" "); + } else { + titleBuilder.append(str).append(" "); + } + } + title = titleBuilder.toString(); + return title.substring(0, title.length() - 1); + } + + public int pairSum(ListNode head) { + List list = new ArrayList<>(); + while (head != null) { + list.add(head.val); + head = head.next; + } + int max = 0; + for (int i = 0; i < list.size() / 2; i++) { + max = Math.max(max, list.get(i) + list.get(list.size() - 1 - i)); + } + return max; + } + + public int longestPalindrome(String[] words) { + List list = Arrays.asList(words); + Collections.sort(list); + boolean[] use = new boolean[list.size()]; + int length = 0; + boolean bl = false; + int bef = -1; + for (int i = 0; i < list.size(); i++) { + if (use[i]) { + continue; + } + String str = list.get(i); + if (str.charAt(0) == str.charAt(1)) { + if (i + 1 < list.size() && str.equals(list.get(i + 1))) { + length += 4; + use[i] = true; + use[i + 1] = true; + } else { + length = bl ? length : length + 2; + bl = true; + use[i] = true; + } + } else { + String restr = new StringBuilder(list.get(i)).reverse().toString(); + if (i > 0 && list.get(i - 1).equals(list.get(i))) { + if (bef + 1 < list.size() && list.get(bef + 1).equals(restr)) { + use[i] = true; + use[bef + 1] = true; + length += 4; + bef += 1; + } + } else { + int index = list.indexOf(restr); + if (index > 0 && !use[index]) { + use[i] = true; + use[index] = true; + length += 4; + bef = index; + } + } + } + } + return length; + } + + public boolean possibleToStamp(int[][] grid, int stampHeight, int stampWidth) { + int xl = grid.length; + int yl = grid[0].length; + int[][] use = new int[xl][yl]; + for (int i = 0; i < xl; i++) { + for (int j = 0; j < yl; j++) { + if (grid[i][j] == 1) { + continue; + } + if (i + stampHeight > xl || j + stampWidth > yl) { + if (use[i][j] == 0) { + return false; + } + continue; + } + int[][] temp = new int[xl][yl]; + boolean bl = false; + for (int k = 0; k < stampHeight; k++) { + for (int l = 0; l < stampWidth; l++) { + if (grid[i + k][j + l] == 1) { + if (use[i][j] == 0) { + return false; + } + bl = true; + } + if (use[i + k][j + l] == 1) { + continue; + } + temp[i + k][j + l] = 1; + } + } + if (bl) { + continue; + } + for (int k = 0; k < stampHeight; k++) { + for (int l = 0; l < stampWidth; l++) { + if (temp[i + k][j + l] == 1) { + use[i + k][j + l] = 1; + } + } + } + + } + } + return true; + } +} diff --git a/src/main/java/contest/y2022/m1/week/Solution275.java b/src/main/java/contest/y2022/m1/week/Solution275.java new file mode 100644 index 0000000..0996df3 --- /dev/null +++ b/src/main/java/contest/y2022/m1/week/Solution275.java @@ -0,0 +1,49 @@ +package contest.y2022.m1.week; + + +import com.code.leet.entiy.TwoArray; + +import java.util.*; + +/** + * @description: + * @author: Administrator + * @date: 2021/8/22-10:29 + */ +public class Solution275 { + public static void main(String[] args) { + Solution275 solution = new Solution275(); + } + + public boolean checkValid(int[][] matrix) { + int[][] yarrs = new int[matrix[0].length][matrix.length]; + for (int i = 0; i < matrix.length; i++) { + int[] arrs = Arrays.copyOf(matrix[i],matrix[0].length); + Arrays.sort(arrs); + if(arrs[0]!=1||arrs[matrix.length-1]!= matrix.length){ + return false; + } + for (int j = 0; j < matrix[0].length; j++) { + yarrs[j][i]=matrix[i][j]; + } + for (int j = 0; j < arrs.length; j++) { + if(arrs[j]!=j+1){ + return false; + } + } + } + for (int i = 0; i < yarrs[0].length; i++) { + int[] arrs = Arrays.copyOf(yarrs[i],yarrs[0].length); + Arrays.sort(arrs); + if(arrs[0]!=1||arrs[yarrs.length-1]!= yarrs.length){ + return false; + } + for (int j = 0; j < arrs.length; j++) { + if(arrs[j]!=j+1){ + return false; + } + } + } + return true; + } +} diff --git a/src/main/java/leetcode/editor/cn/CalculateMoneyInLeetcodeBank.java b/src/main/java/leetcode/editor/cn/CalculateMoneyInLeetcodeBank.java new file mode 100644 index 0000000..b52b3b2 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/CalculateMoneyInLeetcodeBank.java @@ -0,0 +1,66 @@ +//Hercy 想要为购买第一辆车存钱。他 每天 都往力扣银行里存钱。 +// +// 最开始，他在周一的时候存入 1 块钱。从周二到周日，他每天都比前一天多存入 1 块钱。在接下来每一个周一，他都会比 前一个周一 多存入 1 块钱。 +// +// 给你 n ，请你返回在第 n 天结束的时候他在力扣银行总共存了多少块钱。 +// +// +// +// 示例 1： +// +// 输入：n = 4 +//输出：10 +//解释：第 4 天后，总额为 1 + 2 + 3 + 4 = 10 。 +// +// +// 示例 2： +// +// 输入：n = 10 +//输出：37 +//解释：第 10 天后，总额为 (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4) = 37 。注意到第二个星期一， +//Hercy 存入 2 块钱。 +// +// +// 示例 3： +// +// 输入：n = 20 +//输出：96 +//解释：第 20 天后，总额为 (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4 + 5 + 6 + 7 + 8) + (3 +//+ 4 + 5 + 6 + 7 + 8) = 96 。 +// +// +// +// +// 提示： +// +// +// 1 <= n <= 1000 +// +// Related Topics 数学 👍 62 👎 0 + +package leetcode.editor.cn; + +//1716:计算力扣银行的钱 +class CalculateMoneyInLeetcodeBank { + public static void main(String[] args) { + //测试代码 + Solution solution = new CalculateMoneyInLeetcodeBank().new Solution(); + System.out.println(solution.totalMoney(20)); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int totalMoney(int n) { + int count = n / 7; + int bef = (56 + 7 * (count - 1)) * count / 2; + + int index = n % 7; + int aft = (2 * count + index + 1) * index / 2; + return bef + aft; + } + } + +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/CalculateMoneyInLeetcodeBank.md b/src/main/java/leetcode/editor/cn/doc/content/CalculateMoneyInLeetcodeBank.md new file mode 100644 index 0000000..e34b4e8 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/CalculateMoneyInLeetcodeBank.md @@ -0,0 +1,37 @@ +

Hercy 想要为购买第一辆车存钱。他 每天 都往力扣银行里存钱。

+ +

最开始，他在周一的时候存入 1 块钱。从周二到周日，他每天都比前一天多存入 1 块钱。在接下来每一个周一，他都会比 前一个周一 多存入 1 块钱。

+ +

给你 n ，请你返回在第 n 天结束的时候他在力扣银行总共存了多少块钱。

+ +

 

+ +

示例 1：

+ +
输入：n = 4
+输出：10
+解释：第 4 天后，总额为 1 + 2 + 3 + 4 = 10 。
+
+ +

示例 2：

+ +
输入：n = 10
+输出：37
+解释：第 10 天后，总额为 (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4) = 37 。注意到第二个星期一，Hercy 存入 2 块钱。
+
+ +

示例 3：

+ +
输入：n = 20
+输出：96
+解释：第 20 天后，总额为 (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4 + 5 + 6 + 7 + 8) + (3 + 4 + 5 + 6 + 7 + 8) = 96 。
+
+ +

 

+ +

提示：

+ +
    +
  • 1 <= n <= 1000
    • +
+
Related Topics
  • 数学

  • 👍 62
  • 👎 0
    • \ No newline at end of file