qzjs

剑指offer...

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

/ 注册

全部文章 / 剑指offer（Java实现）（共38篇）

剑指offer（29）最小的k个数

public class Solution { public int[] GetLeastNumbers_Solution(int [] arr, int k) { if(k < 1 || k > arr.length){ return a...

2019-04-02

0 441

剑指offer（28）数组中出现次数超过一半的数字

public class Solution { public int MoreThanHalfNum_Solution(int [] array) { int candidate = 0;//候选 int count = 0;//次数 for(...

2019-04-01

0 476

剑指offer（25）复制含有随机指针节点的链表

class RandomListNode{ int lebal; RandomListNode next; RandomListNode random; public RandomListNode(int lebal){ this.lebal = le...

2019-04-01

0 540

剑指offer（24）二叉树中和为某一值的路径

import java.util.ArrayList; import java.util.Comparator; import java.util.Collections; /** public class TreeNode { int val = 0; TreeNode left ...

2019-03-28

0 388

剑指offer（22）从上往下打印二叉树

import java.util.ArrayList; import java.util.Queue; import java.util.LinkedList; /** public class TreeNode { int val = 0; TreeNode left = null...

2019-03-27

0 494

剑指offer（20）包含min函数的栈

import java.util.Stack; import java.util.Iterator; public class Solution { Stack<Integer> stack = new Stack<Integer>(); pub...

2019-03-26

0 426

剑指offer（18）二叉树镜像

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

2019-03-22

0 426

剑指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（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