cfylove的专栏

在优先队列中，优先级高的元素先出队列。标准库默认使用元素类型的优先队列的第一种用法，也是最常用的用法：priority_queueint> qi;通过故示例1中输出结果为：9 6 5 3 2第二种方法：在示例1中，如果我们要把元素从小到大输出怎么办呢？这时我们可以传入一个比较函数，使用functional.h函数对象作为比较函数。priority

题目内容 Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling you

题目内容 Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly sinc

题目内容 Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front element.e

题目描述 Invert a binary tree. 题目分析 将二叉树翻转，通过不断递归实现二叉树的翻转。/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNo

题目内容 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with val

题目内容 Given two strings s and t, write a function to determine if t is an anagram of s.For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false.Note: You may assume

题目内容 You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 题目分析 我们假设，最后一步完成爬台阶。那么就有两种爬法出

题目内容 Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 题目分析 删除已排序链表中重复出现的结点，所有

题目内容 Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it i

题目内容 Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every eleme

题目内容 Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1B -> 2C -> 3...Z -> 26AA -> 27AB -> 28

题目内容 Reverse a singly linked list.题目分析 对单链表进行反转 单链表翻转的时候，搞懂结点的赋值与更新就OK了，这块有点儿绕。/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListN

题目描述 给出一棵二叉树，求二叉树的宽度。 解析 二叉树的宽度：空的二叉树的宽度为0，非空二叉树的宽度为各层结点个数的最大值。 依然用BFS。/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode rig

Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.题目解析 求一个二叉树的树的深度。 有两种求法，深度优先（DFS）和广度优先（BF

1 概述　　C语言允许用户自己指定这样一种数据结构，它由不同类型的数据组合成一个整体，以便引用，这些组合在一个整体中的数据是互相联系的，这样的数据结构称为结构体，它相当于其它高级语言中记录。　　声明一个结构休类型的一般形式如下：　　struct 结构体名　　{成员列表};　　结构体名，用作结构体类型的标志，它又称 结构体标记，大括号内是该结构体中的各个成员，

辗转相除法求两个数的最大公约数的步骤如下：先用小的一个数除大的一个数，得第一个余数；再用第一个余数除小的一个数，得第二个余数；又用第二个余数除第一个余数，得第三个余数；这样逐次用后一个数去除前一个余数，直到余数是0为止。那么，最后一个除数就是所求的最大公约数（如果最后的除数是1，那么原来的两个数是互质数）。例如求1515和600的最大公约数，第一次：用600除1515，商2余315；

STL中的每个算法都非常精妙，接下来的几天我想集中学习一下STL中的算法。　　ForwardIter lower_bound(ForwardIter first, ForwardIter last,const _Tp& val)算法返回一个非递减序列[first, last)中的第一个大于等于值val的位置。     ForwardIter upper_bound(ForwardI

题目描述A number that reads the same from right to left as when read from left to right is called a palindrome. The number 12321 is a palindrome; the number 77778 is not. Of course, palindromes have neithe

题目描述The Merry Milk Makers company buys milk from farmers, packages it into attractive 1- and 2-Unit bottles, and then sells that milk to grocery stores so we can each start our day with delicious cerea

题目Palindromes are numbers that read the same forwards as backwards. The number 12321 is a typical palindrome.Given a number base B (2 <= B <= 20 base 10), print all the integers N (1 <= N <= 300 base 1

题目内容 Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the following

题目You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be th

题目：Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usin

单链表中环的检测首先设置两个指针，分别命名为fast和slow，fast指针每次向后移2步，slow指针每次向后移1步。如果，fast指针最后走到尾结点，则没有环。如果，fast指针和slow指针相遇，则证明有环。环的起始结点的查询当fast与slow相遇之后，fast指针从头结点开始走，每次走1步当fast再次与slow相遇以后，相遇处的结点为环的入口结点证明推导1：fast指针的步长

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element always

题目内容 Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 题目分析 递归调用函