qq_39904117的博客

import java.math.BigInteger; class Solution { public int cuttingRope(int n) { if(n <= 1) return 0; if(n == 2) return 1; if(n == 3) ...

class Solution { public int cuttingRope(int n) { if (n <= 1) { return 0; } if (n == 2) { return 1; } if (n == 3) { r...

class Solution { public int minArray(int[] numbers) { if (numbers == null || numbers.length == 0) { return 0; } int left = 0; int right = numbers.leng...

class Solution { public int numWays(int n) { if (n <= 1) { return 1; } if (n == 2) { return 2; } long first = 1; long s...

class Solution { public int fib(int n) { if ( n <= 1) { return n; } long first = 0; long second = 1; for (int i = 2; i <= n; i++) { ...

class CQueue { public Stack<Integer> stack1; public Stack<Integer> stack2; public CQueue() { stack1 = new Stack<Integer>(); stack2 = new Stack<Integ...

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public int[] reversePrint(...

class Solution { public String replaceSpace(String s) { if (s == null) { return null; } StringBuffer sb = new StringBuffer(); for (int i = 0; i < s...

class Solution { public boolean findNumberIn2DArray(int[][] matrix, int target) { if (matrix == null || matrix.length == 0) { return false; } int row = 0; ...

class Solution { public int findRepeatNumber(int[] nums) { if (nums == null || nums.length == 0) { return 0; } int[] temp = new int[nums.length]; for (...