diff --git a/Week_02/id_12/LeetCode_1_012.java b/Week_02/id_12/LeetCode_1_012.java new file mode 100644 index 00000000..feda1977 --- /dev/null +++ b/Week_02/id_12/LeetCode_1_012.java @@ -0,0 +1,19 @@ +class Solution { + public int[] twoSum(int[] nums, int target) { + Map map = new HashMap<>(); + int[] result = new int[2]; + int temp; + for (int i = 0; i < nums.length; i++) { + temp = nums[i]; + if (map.containsKey(temp)) { + if (map.get(temp) != i) { + result[0] = i; + result[1] = map.get(temp); + } + } else { + map.put(target - temp, i); + } + } + return result; + } +} diff --git a/Week_02/id_12/LeetCode_242_012.java b/Week_02/id_12/LeetCode_242_012.java new file mode 100644 index 00000000..69be2e9c --- /dev/null +++ b/Week_02/id_12/LeetCode_242_012.java @@ -0,0 +1,9 @@ +class Solution { + public boolean isAnagram(String s, String t) { + int[] alphabet = new int[26]; + for(char c : s.toCharArray()) alphabet[c - 'a']++; + for(char c : t.toCharArray()) alphabet[c - 'a']--; + for (int a : alphabet) if(a != 0) return false; + return true; + } +} \ No newline at end of file diff --git a/Week_02/id_12/LeetCode_3_012.java b/Week_02/id_12/LeetCode_3_012.java new file mode 100644 index 00000000..c973cdb3 --- /dev/null +++ b/Week_02/id_12/LeetCode_3_012.java @@ -0,0 +1,22 @@ +class Solution { + public int lengthOfLongestSubstring(String s) { + Deque characterDeque = new LinkedList<>(); + int result = 0; + for (int i = 0; i < s.length(); i++) { + char c = s.charAt(i); + if (characterDeque.contains(c)) { + int len = characterDeque.size(); + if (len > result) { + result = len; + } + while (c != characterDeque.peek()) { + characterDeque.poll(); + } + characterDeque.poll(); + } + characterDeque.add(c); + } + int size = characterDeque.size(); + return size > result ? size : result; + } +} \ No newline at end of file diff --git a/Week_02/id_12/NOTE.md b/Week_02/id_12/NOTE.md deleted file mode 100644 index 107ea7d6..00000000 --- a/Week_02/id_12/NOTE.md +++ /dev/null @@ -1 +0,0 @@ -# 学习笔记 diff --git "a/Week_02/id_12/\345\255\246\344\271\240\346\200\273\347\273\223.md" "b/Week_02/id_12/\345\255\246\344\271\240\346\200\273\347\273\223.md" new file mode 100644 index 00000000..0e7305b9 --- /dev/null +++ "b/Week_02/id_12/\345\255\246\344\271\240\346\200\273\347\273\223.md" @@ -0,0 +1,6 @@ +# 学习笔记 +这周由于比较忙我只做了3题，但是3题我都认真做了，总结了一下经验： +1.第1题，刚开始确实想不出来这里面存在一个映射关系，可以利用到hashmap，学到了，以后碰到类似的题目，一定到先考虑有没有一对一映射的可能性。 +2.第3题，刚开始我就想到了这里可以利用一个双端队列来实现，因为从头到尾遍历的过程中，头和尾都会出队列，之后我又对我的代码优化了几次，感觉受益匪浅，起码在双端队列这一块学到了很多。 +3.第242题，这一题我刚开始的想法是可以排序后比较，直到我看到了leetcode英文版上面的讨论区学到了这个方法，利用26个长度的数组来判断，真的比较巧妙，从这里我学到了，以后一定要注意题目当中的关键字，比如只包含小写字母，这就是一个很明显的暗示，可以立马联想到这个题目。 +算法训练是一个长期的过程，这周我只完成了3道题目，感觉很惭愧，下周我会挤出更多的时间来完成算法训练。 \ No newline at end of file diff --git a/Week_03/id_12/LeetCode_200_012.java b/Week_03/id_12/LeetCode_200_012.java new file mode 100644 index 00000000..bf08ce03 --- /dev/null +++ b/Week_03/id_12/LeetCode_200_012.java @@ -0,0 +1,55 @@ +//Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water. +// +// Example 1: +// +// +//Input: +//11110 +//11010 +//11000 +//00000 +// +//Output: 1 +// +// +// Example 2: +// +// +//Input: +//11000 +//11000 +//00100 +//00011 +// +//Output: 3 +// + + +class Solution { + + int[] x = {1, 0, -1, 0}; + int[] y = {0, -1, 0, 1}; + + public int numIslands(char[][] grid) { + int count = 0; + for (int i = 0; i < grid.length; i++) { + for (int j = 0; j < grid[i].length; j++) { + if (grid[i][j] == '1') { + count++; + sink(grid, i, j); + } + } + } + return count; + } + + private void sink(char[][] grid, int i, int j) { + if (i < 0 || j < 0 || i > grid.length - 1 || j > grid[i].length - 1 || grid[i][j] == '0') { + return; + } + grid[i][j] = '0'; + for (int index = 0; index < 4; index++) { + sink(grid, i + x[index], j + y[index]); + } + } +} \ No newline at end of file diff --git a/Week_03/id_12/LeetCode_210_012.java b/Week_03/id_12/LeetCode_210_012.java new file mode 100644 index 00000000..33c43150 --- /dev/null +++ b/Week_03/id_12/LeetCode_210_012.java @@ -0,0 +1,42 @@ +class Solution { + + public int[] findOrder(int numCourses, int[][] prerequisites) { + List[] course = new List[numCourses]; + int[] map = new int[numCourses]; + List resultList = new ArrayList(); + for (int i = 0; i < numCourses; i++) { + course[i] = new ArrayList(); + } + for (int i = 0; i < prerequisites.length; i++) { + course[prerequisites[i][0]].add(prerequisites[i][1]); + } + for (int i = 0; i < numCourses; i++) { + if (!dfs(course, i, resultList, map)) { + return new int[0]; + } + } + int[] an = new int[resultList.size()]; + for (int i = 0; i < resultList.size(); i++) { + an[i] = resultList.get(i); + } + return an; + } + + private boolean dfs(List[] course, int req, List list, int[] map) { + if (map[req] == 0) { + map[req] = 1; + for (int i = 0; i < course[req].size(); i++) { + if (!dfs(course, (int) course[req].get(i), list, map)) { + return false; + } + } + map[req] = 2; + } else if (map[req] == 1) { + return false; + } else if (map[req] == 2) { + return true; + } + list.add(req); + return true; + } +} \ No newline at end of file diff --git a/Week_03/id_12/LeetCode_295_012.java b/Week_03/id_12/LeetCode_295_012.java new file mode 100644 index 00000000..09a6a12c --- /dev/null +++ b/Week_03/id_12/LeetCode_295_012.java @@ -0,0 +1,21 @@ +class MedianFinder { + + PriorityQueue min = new PriorityQueue(); + PriorityQueue max = new PriorityQueue(1000, Collections.reverseOrder()); + + public void addNum(int num) { + max.offer(num); + min.offer(max.poll()); + if (max.size() < min.size()) { + max.offer(min.poll()); + } + } + + public double findMedian() { + if (max.size() == min.size()) { + return (max.peek() + min.peek()) / 2.0; + } else { + return max.peek(); + } + } +}; \ No newline at end of file diff --git a/Week_03/id_12/LeetCode_703_012.java b/Week_03/id_12/LeetCode_703_012.java new file mode 100644 index 00000000..adaafd92 --- /dev/null +++ b/Week_03/id_12/LeetCode_703_012.java @@ -0,0 +1,23 @@ +class KthLargest { + + final PriorityQueue q; + final int k; + + public KthLargest(int k, int[] a) { + this.k = k; + q = new PriorityQueue<>(k); + for (int n : a) { + add(n); + } + } + + public int add(int n) { + if (q.size() < k) { + q.offer(n); + } else if (q.peek() < n) { + q.poll(); + q.offer(n); + } + return q.peek(); + } +} \ No newline at end of file diff --git a/Week_03/id_12/NOTE.md b/Week_03/id_12/NOTE.md deleted file mode 100644 index 107ea7d6..00000000 --- a/Week_03/id_12/NOTE.md +++ /dev/null @@ -1 +0,0 @@ -# 学习笔记 diff --git "a/Week_03/id_12/\345\255\246\344\271\240\346\200\273\347\273\223.md" "b/Week_03/id_12/\345\255\246\344\271\240\346\200\273\347\273\223.md" new file mode 100644 index 00000000..be6d9377 --- /dev/null +++ "b/Week_03/id_12/\345\255\246\344\271\240\346\200\273\347\273\223.md" @@ -0,0 +1,2 @@ +# 学习笔记 +首先感觉作业题目越来越难了，第200题老师上课讲过了，对小岛沉没这种解法很有印象，也安装老师要求的用两个数组来表示方向，算是一次课堂温习；第210题，刚开始题目没有看清楚，不清楚第一个参数的作业，提醒自己以后审题一定要仔细，感觉这题的数据结构很像Java中的HashMap，可以借鉴着来理解；第295题感觉用优先队列来解决太巧妙了，学到了一招；第703题算是对优先队列的又一次灵活应用。 \ No newline at end of file