qzjs

分类

LeetCode(3) 剑指offer（Java实现）(38) 华为机试(1) 基础知识及算法(2) 未归档(42) 牛客网（华为机试）(1) 纠删码(1)

/ 注册

全部文章（共88篇）

剑指offer（17）树的子结构

/** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = v...

2019-03-22

0 493

剑指offer（16）单调不减合并两个排序的链表

/* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }*/ public class Solution { ...

2019-03-21

0 453

剑指offer（15）反转链表

/* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }*/ public class Solution { ...

2019-03-21

0 445

剑指offer（14）输出链表的倒数第k个节点

/* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }*/ public class Solution { ...

2019-03-20

0 414

剑指offer（13）调整数组顺序使奇数位于偶数前面

import java.util.List; import java.util.ArrayList; public class Solution { public void reOrderArray(int [] array) { List<Integer> o...

2019-03-20

0 446

剑指offer（12）数值的整数次方

public class Solution { public double Power(double base, int exponent) { double result = 1.0; if(exponent == 0){ retur...

2019-03-19

0 456

剑指offer（11）二进制中1的个数

public class Solution { public int NumberOf1(int n) { int count = 0; while(n != 0){ if((n&1)!=0){ ...

2019-03-19

0 477

剑指offer（10）矩形覆盖

public class Solution { public int RectCover(int target) { int a = 1,b = 2,c = 0; if(target < 0){ return -1; ...

2019-03-18

0 397

剑指offer（9）变态跳台阶

public class Solution { public int JumpFloorII(int target) { if(target < 0){ return -1; }else if(target == 0){ ...

2019-03-18

0 430

剑指offer（8）跳台阶

public class Solution { public int JumpFloor(int target) { int first = 1; int second = 2; int result = 0; if(targe...

2019-03-17

0 413