- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode 164最大间距(java)
class Solution { public int maximumGap(int[] nums) { int len = nums.length; Arrays.sort(nums); int temp = 0; int res = 0; if(len < 2) return 0; for(int i = 0; i < len - 1; i++) { .
2020-11-26 09:15:45
159
原创 LeetCode 324摆动排序(java)
class Solution { public void wiggleSort(int[] nums) { Arrays.sort(nums); int len = nums.length; // 数组克隆,再排序 int[] temp = nums.clone(); for(int i = 0; i < len/ 2; i++) { nums[2 * i] = temp[(len - 1).
2020-11-18 08:35:08
143
原创 LeetCode 1329按矩阵对角线排序(java)
class Solution { public int[][] diagonalSort(int[][] mat) { int m = mat.length, n = mat[0].length; for(int k = 0; k < Math.min(m, n); k++) { for(int i = 0; i< m - 1; i++) { for(int j = 0; j < n -.
2020-11-18 08:22:06
237
原创 LeetCode 1414和为k的最小斐波切纳数字数目(java)
class Solution { public int findMinFibonacciNumbers(int k) { if(k == 0) return 0; int a = 1, b = 1; while(b <= k) { b += a; a = b -a; } return findMinFibonacciNumbers(k - .
2020-11-15 22:22:09
132
原创 LeetCode 738单调递增的数字(java)
class Solution { public int monotoneIncreasingDigits(int N) { int i = 1; int res = N; while( i <= res/10) { int temp = res / i % 100; i *= 10; if(temp / 10 > temp % 10) .
2020-11-01 10:58:27
124
java面试宝典
2019-03-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人