[LeetCode] New 21 Game 新二十一点游戏

Alice plays the following game, loosely based on the card game "21". Alice starts with 0 points, and draws numbers while she has less than K points. During each draw, she gains an integer number of points randomly from the range [1, W], where W…

LeetCode 95 | 构造出所有二叉搜索树

今天是LeetCode专题第61篇文章,我们一起来看的是LeetCode95题,Unique Binary Search Trees II(不同的二叉搜索树II). 这道题的官方难度是Medium,点赞2298,反对160,通过率40.5%.我也仿照steam当中游戏评论的分级,给LeetCode中的题目也给出一个评级标准.按照这个点赞和反对的比例,这道题可以评到特别好评.从题目内容上来说,这是一道不可多得基础拷问的算法题,看着不简单,做起来也不简单,但看了题解之后,你会发现也没你想象得那么难.…

【LeetCode算法-21】Merge Two Sorted Lists

LeetCode第21题 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Example: Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4 翻译: 合并两个有序链表并返回…

cocos2dx新研发的游戏，手机运行时非常热的解决方案

cocos2dx新研发的游戏,手机运行时非常热,有需要的朋友可以参考下. cocos2dx新研发的游戏,手机上运行时导致手机非常热,后来听其他项目组分享时得知,可以通过降帧解决这个问题,原来是cocos2dx默认的60,后来修改为30,测试发现,手机发热问题解决了. 修改代码: AppDelegate.cpp // set FPS. the default value is 1.0/60 if you don't call this pDirector->setAnimationInterval…

C# leetcode 之 096 不同的二叉搜索树

C# leetcode 之 096 不同的二叉搜索树题目描述给定一个整数 n,求以 1 ... n 为节点组成的二叉搜索树有多少种? 二叉搜索树定义左子树上所有节点的值小于根节点, 右子树上左右节点的值大于根节点, 并且左右子树也为二叉搜索树解题思路根据二叉搜索树定义可知, 针对 1 .. n 的排序序列, 选取其中任意一个元素i则1到i-1的元素为左子树节点, i+1到n为右子树的节点. 题目中问的是一共有多少种二叉树, 所以其实不用关心二叉树中节点的值. 由此可知一个树只要节点数相…

Leetcode：96. 不同的二叉搜索树

Leetcode:96. 不同的二叉搜索树 Leetcode:96. 不同的二叉搜索树题目在链接中,点进去看看吧! 先介绍一个名词:卡特兰数卡特兰数卡特兰数Cn满足以下递推关系: \[ C_{n+1}=C_0C_n+C_1C_{n-1}+...+C_nC_0 \] 有兴趣的同学点击这里查看亚特兰数的百度百科很巧的是,这道题可以利用亚特兰数计算出有多少个不同的BST. Don't talk,show me code! class Solution { public: int numTree…

Leetcode：1305. 两棵二叉搜索树中的所有元素

Leetcode:1305. 两棵二叉搜索树中的所有元素 Leetcode:1305. 两棵二叉搜索树中的所有元素思路 BST树中序历遍有序. 利用双指针法可以在\(O(n)\)的复杂度内完成排序. 基于上述两个点,可以很简单的做出这道题. 先中序历遍得到两个有序的数列. 利用双指针法,只需历遍一次就可以得到升序的答案. Talk is cheap . Show me the code . /** * Definition for a binary tree node. * struct Tr…

【leetcode】Jump Game I, II 跳跃游戏一和二

题目: Jump Game I: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index.…

[LeetCode] Design Snake Game 设计贪吃蛇游戏

Design a Snake game that is played on a device with screen size = width x height. Play the game online if you are not familiar with the game. The snake is initially positioned at the top left corner (0,0) with length = 1 unit. You are given a list of…

[LeetCode] Design Tic-Tac-Toe 设计井字棋游戏

Design a Tic-tac-toe game that is played between two players on a n x n grid. You may assume the following rules: A move is guaranteed to be valid and is placed on an empty block.Once a winning condition is reached, no more moves is allowed.A player…

[LeetCode] Chalkboard XOR Game 黑板亦或游戏

We are given non-negative integers nums[i] which are written on a chalkboard. Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first. If erasing a number causes the bitwise XOR of all the elements of the…

LeetCode刷题预备知识(二)

Python四大数据结构的属性及方法在LeetCode刷题预备知识一中我们掌握了常见的内置函数,和四大数据结构的基本概念: 但只掌握这些还远远不够,我们还需了解四大数据结构的属性及方法才能更高效快速的解决问题通过dir()函数可以查看各数据结构的属性及方法一.列表list的属性及方法 >>dir(list) ['__add__', '__class__', '__contains__', '__delattr__', '__delitem__', '__dir__', '__doc__'…

[LeetCode] Serialize and Deserialize BST 二叉搜索树的序列化和去序列化

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another comput…

[LeetCode] Inorder Successor in BST 二叉搜索树中的中序后继节点

Given a binary search tree and a node in it, find the in-order successor of that node in the BST. Note: If the given node has no in-order successor in the tree, return null. 这道题让我们求二叉搜索树的某个节点的中序后继节点,那么我们根据BST的性质知道其中序遍历的结果是有序的, 是我最先用的方法是用迭代的中序遍历方法,然后用…

[LeetCode] Flatten 2D Vector 压平二维向量

Implement an iterator to flatten a 2d vector. For example,Given 2d vector = [ [1,2], [3], [4,5,6] ] By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,2,3,4,5,6]. Hint: How many variables do y…

[LeetCode] Binary Search Tree Iterator 二叉搜索树迭代器

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the next smallest number in the BST. Note: next() and hasNext() should run in average O(1) time and uses…

[LeetCode] Permutations II 全排列之二

Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and [2,1,1]. 这道题是之前那道Permutations 全排列的延伸,由于输入数组有可能出现重复数字,如果按照之前的算法运算,会有…

[Leetcode][Python]21: Merge Two Sorted Lists

# -*- coding: utf8 -*-'''__author__ = 'dabay.wang@gmail.com' 21: Merge Two Sorted Listshttps://oj.leetcode.com/problems/merge-two-sorted-lists/ Merge two sorted linked lists and return it as a new list.The new list should be made by splicing together…

LeetCode 292. Nim Game （取物游戏）

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 the winner. You will take the first turn to remove th…