From 6ba51c8a19b36266407e47d2fa6cb24a70b22e35 Mon Sep 17 00:00:00 2001 From: chengpy <1209492554@qq.com> Date: Mon, 23 Dec 2019 00:43:13 +0800 Subject: [PATCH 1/2] 026-Week 01 --- Week 05/id_026/LeetCode_120_026.java | 18 ++++++++++++++++++ Week 05/id_026/LeetCode_70_026.java | 14 ++++++++++++++ 2 files changed, 32 insertions(+) create mode 100644 Week 05/id_026/LeetCode_120_026.java create mode 100644 Week 05/id_026/LeetCode_70_026.java diff --git a/Week 05/id_026/LeetCode_120_026.java b/Week 05/id_026/LeetCode_120_026.java new file mode 100644 index 000000000..324b2b774 --- /dev/null +++ b/Week 05/id_026/LeetCode_120_026.java @@ -0,0 +1,18 @@ +class Solution { + public int minimumTotal(List> triangle) { + int m = triangle.size(); + List list = triangle.get(m - 1); + int n = list.size(); + int[] dp = new int[m]; + for (int j = 0; j < n; j++) { + Integer integer = list.get(j); + dp[j] = integer; + } + for (int i = m - 2; i >= 0; i--) { + for (int j = 0; j < triangle.get(i).size(); j++) { + dp[j] = Math.min(dp[j], dp[j + 1]) + triangle.get(i).get(j); + } + } + return dp[0]; + } +} \ No newline at end of file diff --git a/Week 05/id_026/LeetCode_70_026.java b/Week 05/id_026/LeetCode_70_026.java new file mode 100644 index 000000000..0ecef838f --- /dev/null +++ b/Week 05/id_026/LeetCode_70_026.java @@ -0,0 +1,14 @@ +public class Solution { + public int climbStairs(int n) { + climb_Stairs(0, n); + } + public int climb_Stairs(int i, int n) { + if (i > n) { + return 0; + } + if (i == n) { + return 1; + } + return climb_Stairs(i + 1, n) + climb_Stairs(i + 2, n); + } +} \ No newline at end of file From 90c8a0287719868a7a0952b9b7085a5adc27dd33 Mon Sep 17 00:00:00 2001 From: chengpy <1209492554@qq.com> Date: Mon, 23 Dec 2019 00:51:55 +0800 Subject: [PATCH 2/2] 026-Week 07 --- Week 07/id_026/LeetCode_1122_026.java | 25 +++++++++++++++++++ Week 07/id_026/LeetCode_547_026.java | 21 ++++++++++++++++ ...7\346\234\254\346\226\207\346\241\243.txt" | 0 3 files changed, 46 insertions(+) create mode 100644 Week 07/id_026/LeetCode_1122_026.java create mode 100644 Week 07/id_026/LeetCode_547_026.java create mode 100644 "Week 07/id_026/\346\226\260\345\273\272\346\226\207\346\234\254\346\226\207\346\241\243.txt" diff --git a/Week 07/id_026/LeetCode_1122_026.java b/Week 07/id_026/LeetCode_1122_026.java new file mode 100644 index 000000000..139fab4f9 --- /dev/null +++ b/Week 07/id_026/LeetCode_1122_026.java @@ -0,0 +1,25 @@ +public int[] relativeSortArray(int[] arr1, int[] arr2) { + int[] m = new int[1001]; + + int[] ref = new int[arr1.length]; + + for(int i = 0; i < arr1.length; i++) { + m[arr1[i]]++; + } + + int cnt = 0; + for(int i = 0; i < arr2.length; i++) { + while(m[arr2[i]] > 0) { + ref[cnt++] = arr2[i]; + m[arr2[i]]--; + } + } + + for(int i = 0; i < 1001; i++) { + while(m[i] > 0) { + ref[cnt++] = i; + m[i]--; + } + } + return ref; +} \ No newline at end of file diff --git a/Week 07/id_026/LeetCode_547_026.java b/Week 07/id_026/LeetCode_547_026.java new file mode 100644 index 000000000..1f73e79c5 --- /dev/null +++ b/Week 07/id_026/LeetCode_547_026.java @@ -0,0 +1,21 @@ +class LRUCache extends LinkedHashMap{ + private int capacity; + + public LRUCache(int capacity) { + super(capacity, 0.75F, true); + this.capacity = capacity; + } + + public int get(int key) { + return super.getOrDefault(key, -1); + } + + public void put(int key, int value) { + super.put(key, value); + } + + @Override + protected boolean removeEldestEntry(Map.Entry eldest) { + return size() > capacity; + } +} diff --git "a/Week 07/id_026/\346\226\260\345\273\272\346\226\207\346\234\254\346\226\207\346\241\243.txt" "b/Week 07/id_026/\346\226\260\345\273\272\346\226\207\346\234\254\346\226\207\346\241\243.txt" new file mode 100644 index 000000000..e69de29bb