摘要:
1 class Solution { 2 public int wiggleMaxLength(int[] nums) { 3 int up = 1, down = 1; 4 if(nums.length == 0) return 0; 5 for(int i = 0; i < nums.lengt 阅读全文
摘要:
1 class Solution { 2 public int matrixScore(int[][] A) { 3 int len1 = A.length, len2 = A[0].length; 4 5 for(int i = 0; i < len1; i++){ 6 if(A[i][0] == 阅读全文