leetcode
JYAyyyyyyy
这个作者很懒,什么都没留下…
展开
-
1021. 删除最外层的括号
1021. 删除最外层的括号代码:class Solution { public String removeOuterParentheses(String S) { StringBuffer str = new StringBuffer(); int countL = 0, countR = 0; for (int i = 0; i < S.length(); i++) { if (S.charAt(原创 2020-08-03 09:15:30 · 70 阅读 · 0 评论 -
496. 下一个更大元素 I
496. 下一个更大元素 I代码:class Solution { public int[] nextGreaterElement(int[] nums1, int[] nums2) { List<Integer> list = new ArrayList<>(); for (int i = 0; i < nums1.length; i++) { int j = 0;原创 2020-08-03 09:15:44 · 91 阅读 · 0 评论 -
1047. 删除字符串中的所有相邻重复项
1047. 删除字符串中的所有相邻重复项代码:class Solution { public String removeDuplicates(String S) { Stack<Character> stack = new Stack(); for (int i = 0; i < S.length(); i++) { if (stack.empty() || stack.peek() != S.charAt原创 2020-08-02 11:42:10 · 80 阅读 · 0 评论 -
剑指 Offer 30. 包含min函数的栈
剑指 Offer 30. 包含min函数的栈代码:class MinStack { Stack<Integer> stack1, stack2; public MinStack() { stack1 = new Stack<>(); stack2 = new Stack<>(); } public void push(int x) { stack1.add(x); if原创 2020-08-02 11:26:05 · 79 阅读 · 0 评论 -
剑指 Offer 09. 用两个栈实现队列
剑指 Offer 09. 用两个栈实现队列代码:class CQueue { Deque<String> deque; public CQueue() { deque = new ArrayDeque<>(); } public void appendTail(int value) { deque.addLast(value + ""); } public int deleteHead() {原创 2020-08-02 10:56:06 · 68 阅读 · 0 评论 -
习题8-7 字符串排序 (20分)
习题8-7 字符串排序 (20分)代码:#include <stdio.h>#include <string.h>int main(){ char str[5][81]; int i = 0, j = 0; for (i = 0; i < 5; i++) scanf("%s", &str[i]); for (i = 0; i < 4; i++) { for (j = i + 1; j < 5; j++) { if (str原创 2020-08-02 08:32:48 · 203 阅读 · 0 评论 -
447. 回旋镖的数量
447. 回旋镖的数量代码:class Solution { public int numberOfBoomerangs(int[][] points) { int count = 0; for (int i = 0; i < points.length; i++) { Map<Integer, Integer> dis = new HashMap<>(); for (原创 2020-08-02 08:35:56 · 83 阅读 · 0 评论 -
720. 词典中最长的单词
720. 词典中最长的单词代码:class Solution { public String longestWord(String[] words) { Set<String> word = new HashSet<>(); String string = null; int max = 0; for (int i = 0; i < words.length; i++) word.add(words[原创 2020-08-01 16:58:10 · 95 阅读 · 0 评论 -
463. 岛屿的周长
463. 岛屿的周长代码:class Solution { public int islandPerimeter(int[][] grid) { int C = 0; for (int i = 0; i < grid.length; i++) { for (int j = 0; j < grid[i].length; j++) { if (grid[i]原创 2020-08-01 16:06:57 · 69 阅读 · 0 评论 -
299. 猜数字游戏
299. 猜数字游戏代码:class Solution { public String getHint(String secret, String guess) { StringBuffer str = new StringBuffer(); int[] secrets = new int[10]; int[] guesses = new int[10]; int cows = 0, bulls = 0; for原创 2020-08-01 15:48:33 · 87 阅读 · 0 评论 -
204. 计数质数
204. 计数质数代码:class Solution { public int countPrimes(int n) { boolean isPrime[] = new boolean[n + 1]; for (int i = 1; i <=n; i++) isPrime[i] = true; if (n <= 1) return 0; if (n == 2) return 1; int count =原创 2020-08-01 11:16:50 · 98 阅读 · 0 评论 -
706. 设计哈希映射
706. 设计哈希映射代码:class MyHashMap { /** Initialize your data structure here. */ Map<Integer, Integer> map; public MyHashMap() { map = new HashMap<Integer, Integer>(); } /** value will always be non-negative. */原创 2020-07-31 18:57:28 · 80 阅读 · 0 评论 -
705. 设计哈希集合
705. 设计哈希集合代码:class MyHashSet { /** Initialize your data structure here. */ Set<Integer> set ; public MyHashSet() { set = new HashSet<>(); } public void add(int key) { set.add(key); } public voi原创 2020-07-31 18:51:50 · 86 阅读 · 0 评论 -
575. 分糖果
575. 分糖果代码:class Solution { public int distributeCandies(int[] candies) { Set<Integer> candie = new HashSet<>(); int kinds = 0; for (int i = 0; i < candies.length; i++) candie.add(candies[i]); if (candi原创 2020-07-31 18:44:42 · 82 阅读 · 0 评论 -
389. 找不同
389. 找不同代码:class Solution { public char findTheDifference(String s, String t) { char[] S = s.toCharArray(); char[] T = t.toCharArray(); Arrays.sort(S); Arrays.sort(T); for (int i = 0; i < S.length; i++)原创 2020-07-31 18:04:56 · 172 阅读 · 0 评论 -
205. 同构字符串
205. 同构字符串代码:class Solution { public boolean isIsomorphic(String s, String t) { if (s.length() != t.length()) return false; Map<Character, Character> string = new HashMap<>(); Set<Character> str1 = new HashS原创 2020-07-31 17:46:36 · 77 阅读 · 0 评论 -
771. 宝石与石头
771. 宝石与石头代码:class Solution { public int numJewelsInStones(String J, String S) { int count = 0; Map<Character, Integer> counter = new HashMap<>(); for (int i = 0; i < S.length(); i++) { if (!原创 2020-07-30 17:26:34 · 81 阅读 · 0 评论 -
500. 键盘行
500. 键盘行代码:class Solution { public String[] findWords(String[] words) { String[] words1 = new String[words.length]; for (int i = 0; i < words.length; i++) words1[i] = words[i]; List<String> string = new ArrayList<原创 2020-07-30 17:19:24 · 95 阅读 · 0 评论 -
594. 最长和谐子序列
594. 最长和谐子序列代码:class Solution { public int findLHS(int[] nums) { int ret = 0; for (int i = 0; i < nums.length; i++) { int flag = 0, count = 0; for (int j = 0; j < nums.length; j++) {原创 2020-07-30 16:31:13 · 57 阅读 · 0 评论 -
599. 两个列表的最小索引总和
599. 两个列表的最小索引总和代码:class Solution { public String[] findRestaurant(String[] list1, String[] list2) { Map<String, Integer> list = new HashMap<>(); Map<String, Integer> List1 = new HashMap<>(); int min =原创 2020-07-30 11:19:06 · 89 阅读 · 0 评论 -
961. 重复 N 次的元素
961. 重复 N 次的元素代码:class Solution { public int repeatedNTimes(int[] A) { Arrays.sort(A); for (int i = 0; i < A.length - 1; i++) { if (A[i] == A[i + 1]) return A[i]; } return -1; }}...原创 2020-07-30 11:03:30 · 59 阅读 · 0 评论 -
习题4-11 兔子繁衍问题 (15分)
习题4-11 兔子繁衍问题 (15分)代码:#include <stdio.h>int main(){ int month = 1, pre = 0, start = 1, end = 0, n = 0, count = 1; scanf("%d", &n); if (n == start) printf("1"); else { end = pre + start; count++; while (end < n) { pre = start;原创 2020-07-29 16:10:55 · 219 阅读 · 0 评论 -
1078. Bigram 分词
1078. Bigram 分词代码:class Solution { public String[] findOcurrences(String text, String first, String second) { List<String> list = new ArrayList<>(); String[] str = text.split(" "); for (int i = 0; i < str.lengt原创 2020-07-29 10:09:43 · 67 阅读 · 0 评论 -
970. 强整数
970. 强整数代码:class Solution { public List<Integer> powerfulIntegers(int x, int y, int bound) { List<Integer> list = new ArrayList<>(); for (int i = 1; i < bound; i *= x) { for (int j = 1; j <原创 2020-07-29 10:01:00 · 93 阅读 · 0 评论 -
645. 错误的集合
645. 错误的集合代码:class Solution { public int[] findErrorNums(int[] nums) { int[] error = new int[2]; int[] count = new int[nums.length + 1]; count[0] = -1; for (int i = 0; i < nums.length; i++) count[nums[i]]++;原创 2020-07-29 09:11:12 · 64 阅读 · 0 评论 -
748. 最短完整词
748. 最短完整词代码:class Solution { public String shortestCompletingWord(String licensePlate, String[] words) { int[] countWorld = new int[27]; String str = null; licensePlate = licensePlate.toLowerCase(); for (int i = 0;原创 2020-07-29 08:55:24 · 66 阅读 · 0 评论 -
884. 两句话中的不常见单词
884. 两句话中的不常见单词代码:class Solution { public String[] uncommonFromSentences(String A, String B) { if (A.equals(B)) return null; List<String> list = new ArrayList<>(); String[] a = A.split(" "); String[] b = B原创 2020-07-28 21:57:50 · 81 阅读 · 0 评论 -
1207. 独一无二的出现次数
1207. 独一无二的出现次数代码:class Solution { public boolean uniqueOccurrences(int[] arr) { HashMap<Integer, Integer> counter = new HashMap<>(); for (int i = 0; i < arr.length; i++) { if (!counter.containsKey(原创 2020-07-28 21:43:22 · 97 阅读 · 0 评论 -
953. 验证外星语词典
953. 验证外星语词典代码:class Solution { public boolean isAlienSorted(String[] words, String order) { HashMap<Character, Integer> orders = new HashMap<>(); for (int i = 0; i < order.length(); i++) orders.put(order.charAt(i), i)原创 2020-07-28 21:35:55 · 71 阅读 · 0 评论 -
290. 单词规律
290. 单词规律代码;class Solution { public boolean wordPattern(String pattern, String str) { String[] s = str.split(" "); if (pattern.length() != s.length) return false; StringBuffer str1 = new StringBuffer(); StringBuffer s原创 2020-07-28 21:14:04 · 73 阅读 · 0 评论 -
剑指 Offer 50. 第一个只出现一次的字符
剑指 Offer 50. 第一个只出现一次的字符代码:class Solution { public char firstUniqChar(String s) { HashMap<Character, Boolean> counter = new HashMap<Character, Boolean>(); for (int i = 0; i < s.length(); i++) counter.put(s.charAt(i), !c原创 2020-07-28 20:54:09 · 58 阅读 · 0 评论 -
1403. 非递增顺序的最小子序列
1403. 非递增顺序的最小子序列代码:class Solution { public List<Integer> minSubsequence(int[] nums) { List<Integer> list = new ArrayList<>(); int max = Integer.MIN_VALUE, index = 0; Arrays.sort(nums); for (int i =原创 2020-07-27 21:48:49 · 105 阅读 · 0 评论 -
1528. 重新排列字符串
1528. 重新排列字符串代码:```javaclass Solution { public String restoreString(String s, int[] indices) { char[] str = new char[indices.length]; for (int i = 0; i < indices.length; i++) str[indices[i]] = s.charAt(i); return Strin原创 2020-07-27 21:22:42 · 115 阅读 · 0 评论 -
1356. 根据数字二进制下 1 的数目排序
1356. 根据数字二进制下 1 的数目排序代码:class Solution { public int[] sortByBits(int[] arr) { int[] sort = new int[arr.length]; for (int i = 0; i < arr.length; i++) { sort[i] = Integer.bitCount(arr[i]) * 10000 + arr[i];原创 2020-07-27 21:12:20 · 67 阅读 · 1 评论 -
441. 排列硬币
441. 排列硬币代码:class Solution { public int arrangeCoins(int n) { int count = 0; for (int i = 1;; i++) { n -= i; if (n >= 0) count++; else break; } return count; }}...原创 2020-07-27 20:56:31 · 41 阅读 · 0 评论 -
1237. 找出给定方程的正整数解
1237. 找出给定方程的正整数解代码:class Solution { public List<List<Integer>> findSolution(CustomFunction customfunction, int z) { List<List<Integer>> list = new ArrayList<>(); for (int i = 1; i <= 1000; i++)原创 2020-07-27 20:49:24 · 107 阅读 · 0 评论