- 博客(25)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode 1374生成每种字符都是奇数个的字符串(java)
class Solution { public String generateTheString(int n) { if(n < 1) return ""; char[] ch = new char[n]; for(int i = 0; i < n- 1; i++) { ch[i] = 'a'; } ch[n - 1] = (n & 1) == .
2020-10-21 14:07:15
216
原创 LeetCode 1389按既定顺序创建目标数组(java)
class Solution { public int[] createTargetArray(int[] nums, int[] index) { List<Integer> list = new ArrayList<>(); for(int i = 0; i < index.length; i++) { list.add(index[i], nums[i]); }..
2020-10-21 13:51:28
150
1
原创 LeetCode 1464数组中两元素的最大乘积(java)
class Solution { public int maxProduct(int[] nums) { int temp1 = nums[0], temp2 = nums[1]; for(int i = 2; i< nums.length; i ++) { if(temp1 > temp2) temp2 = nums[i] > temp2 ? nums[i] : temp2; .
2020-10-21 13:41:53
202
原创 LeetCode 1523在区间范围内统计奇数数目(java)
```javaclass Solution { public int countOdds(int low, int high) { return (high + 1) / 2 - low / 2; }}
2020-10-20 13:34:57
257
原创 LeetCode 1460通过翻转子数组使两个数组相等(java)
class Solution { public boolean canBeEqual(int[] target, int[] arr) { Arrays.sort(target); Arrays.sort(arr); for(int i = 0; i < arr.length; i++) { if(arr[i] != target[i]) return false; }..
2020-10-20 13:27:55
169
原创 LeetCode 1323 6和9组成的最大数字(java)
class Solution { public int maximum69Number (int num) { int pos = 0, temp = num, n =1; while(temp != 0) { pos = temp % 10 == 6 ? n : pos; temp = temp / 10; n ++; } return pos == 0 ? .
2020-10-20 13:22:28
194
原创 LeetCode 1512好数对的数目(java)
class Solution { public int numIdenticalPairs(int[] nums) { int res =0, len = nums.length; if(len > 1) { for(int i = 0; i < len; i++) { for(int j = i + 1; j < len; j++){ .
2020-10-19 13:44:29
133
原创 LeetCode 1624两个相同字符之间的最长子字符串(java)
class Solution { public int maxLengthBetweenEqualCharacters(String s) { int size = s.length(); int res = -1; for(int start = 0; start < size - 1; start++) { for(int end = start + 1; end < size; end++) { .
2020-10-19 13:38:28
397
原创 LeetCode1619删除某些元素后的数组均值(java)
class Solution { public double trimMean(int[] arr) { Arrays.sort(arr); int len = arr.length; int start = len / 20, end = len - len / 20; double sum = 0; for(int i = start;i < end; i++) { sum += a..
2020-10-19 13:30:59
190
原创 LeetCode 1385两个数组间的距离值(java)
class Solution { public int findTheDistanceValue(int[] arr1, int[] arr2, int d) { int res = 0; for(int i = 0; i < arr1.length; i++) { boolean flag = false; for(int j = 0; j < arr2.length; j++) { ..
2020-10-16 08:27:27
145
原创 Leetcode 1455检查单词是否为句中其他单词的前缀(java)
class Solution { public int isPrefixOfWord(String sentence, String searchWord) { if(null == sentence || null == searchWord) return -1; String [] str = sentence.split(" "); for(int i = 0; i < str.length; ++i) {..
2020-10-14 21:06:53
154
原创 LeetCode 1450在给定时间做作业的学生人数(java)
class Solution { public int busyStudent(int[] startTime, int[] endTime, int queryTime) { int res = 0; for(int i = 0; i< startTime.length; i++) { if(queryTime >= startTime[i] && queryTime <= endTime[i]) ..
2020-10-14 20:55:06
131
原创 LeetCode 1446 连续字符(java)
class Solution { public int maxPower(String s) { int len = s.length(); if(len <= 1) return len; int res = 1; char[] chS = s.toCharArray(); for(int i = 0; i < len - 1; ++i) { int j..
2020-10-14 20:47:32
145
原创 LeetCode 1266访问所有点的最小时间(java)
class Solution { public int minTimeToVisitAllPoints(int[][] points) { int res = 0; for(int i = 1; i< points.length; ++i) { res += Math.max(Math.abs(points[i][0] - points[i -1][0]), Math.abs(points[i][1] - points[i - 1][..
2020-10-12 14:03:52
175
原创 LeetCode 1281整数的各位积和之差(java)
class Solution { public int subtractProductAndSum(int n) { int temp = 1; int sum = 0; while(n != 0) { temp *= n %10; sum += n % 10; n /= 10; } return temp - sum; }}
2020-10-12 13:58:52
121
原创 LeetCode 946验证栈序列(java)
class Solution { public boolean validateStackSequences(int[] pushed, int[] popped) { if(null == pushed || null == popped) return false; Stack<Integer> stack = new Stack<>(); int pos = 0; for(int.
2020-10-10 08:56:57
179
原创 LeetCode 142环形链表2(java)
public class Solution { public ListNode detectCycle(ListNode head) { if(null == head) return null; ListNode fast = head, slow = head; while (true) { if (fast == null || fast.next == null) return null;.
2020-10-10 08:25:23
74
原创 LeetCode 1232缀点成线(java)
class Solution { public boolean checkStraightLine(int[][] coordinates) { if( coordinates.length == 2) return true; for(int i = 0; i< coordinates.length - 2; ++i) { int x1 = coordinates[i + 1][0] - coordina..
2020-10-09 10:41:48
153
原创 LeetCode 1299将每个元素替换为右侧最大元素(java)
class Solution { public int[] replaceElements(int[] arr) { int max = -1; int len = arr.length; for(int i = len - 1; i >= 0; i--) { int temp = arr[i]; arr[i] = max; max = Math.max(max, temp.
2020-10-09 10:24:28
156
原创 LeetCode 1413逐步求和得到整数的最小值(java)
class Solution { public int minStartValue(int[] nums) { int sum = 0, start = 0; for(int num : nums) { sum += num; start = Math.max(start, 1 - sum); } return Math.max(start, 1); }}
2020-10-05 11:50:02
207
原创 LeetCode 1408数组中的字符串匹配(java)
class Solution { public List<String> stringMatching(String[] words) { List<String> res = new ArrayList<>(); if(null == words) return res; String str = String.join("-",words); for(String w.
2020-10-05 11:45:02
146
原创 LeetCode1539第k个缺失的正整数(java)
class Solution { public int findKthPositive(int[] arr, int k) { int len = arr.length; if(null == arr) { return 0; } for(int i = 0; i < len; i++) { if(arr[i] - i - 1 >= k) r.
2020-10-03 09:20:15
293
原创 LeetCode 1528重新排列字符串(java)
class Solution { public String restoreString(String s, int[] indices) { if(null == s || null == indices) return null; char [] ch = new char[indices.length]; for(int i = 0; i < indices.length; i++) { ..
2020-10-03 08:55:59
311
原创 LeetCode 1550存在连续三个奇数的数组(java)
class Solution { public boolean threeConsecutiveOdds(int[] arr) { if(null == arr) return false; int count = 0; for(int temp : arr) { if(temp %2 != 0 ) count++; else .
2020-10-02 10:44:22
126
原创 LeetCode 771宝石与石头(Java)
class Solution { public int numJewelsInStones(String J, String S) { if(J == null || S== null ) return 0; int num = 0; for(char s : S.toCharArray()) { for(char j : J.toCharArray()) { if(s.
2020-10-02 10:39:08
114
java面试宝典
2019-03-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人