- 博客(22)
- 收藏
- 关注
RSS订阅原创 游戏自评——从电竞化看LOL的设计/修改思路
进阶报告题目：从电竞化看LOL的设计/修改思路目录一、STAR法则分析 21.1 Situation 21.2 Task 21.3 Action 21.4 Result 3二、游戏机制为电竞带来了什么？ 52.1从重做英雄来看 62.2从地图机制来看 72.3简单小结 8三、后续修改思路猜测 9四、全文总结 10 一、STAR法则分析...
2018-12-08 15:26:06
553
原创 游戏自评——英雄无敌手游
英雄无敌手游——IP+老玩法，如何保持玩家的活力等级：37 花费：1元 关卡：1-9章全通满星 战力：15w英雄无敌端游是一个回合制策略游戏，而手游采用了刀塔传奇模式的卡牌玩法，这样一个跨度极大的转变过程当中，如何保证口碑不坏，服务好高端玩家，还能留住边缘玩家呢？内容部分分为几点帮助了英雄无敌：1.核心玩法平衡性保证新手/普通玩家体验游戏核心内容之一的兵种，除开培养数值的硬性指标上，它将兵种克制关系
2017-07-18 19:59:25
674
原创 游戏自评——CF手游
对于移动端FPS游戏——CFm的理解与期待1.概括性理解CF手游是一款移动端上的FPS游戏，其IP延续自端游上的CF，可以说天生带着一批粉丝，也可以肯定的是，玩家对于游戏的品质也会有着更高的要求。这一点上CF手游没有让玩家们失望，几乎完整的复刻了端游上的地图，枪械，人物模型等，让玩家一进去就有着强烈的认同感，但是随之而生的操作模式的改变也是一个极大的挑战。
2017-06-13 20:53:24
1651
原创 算法概论 第八章NP-完全问题 8.8题
第八章NP-完全问题 8.8题题目内容8.8 在精准的4SAT（EXACT 4SAT）问题中，输入为一组子句，每个子句都是恰为4个文字的析取，且每个变量最多在每个子句中出现一次。目标是求它的满足赋值——如果赋值存在的话。证明EXACT 4SAT问题为NP-完全问题。解题思路看到这道题目的时候，不难想到我们的目的可能是将3SAT问题归约到EXACT 4SAT问题上即可。 首先，EXACT 4SAT属
2016-12-01 15:45:39
358
原创 29. Divide Two Integers
29 . Divide Two IntegersDifficulty: Medium Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT.解题思路题目短小却不容易。不能用乘除取模运算来计算两个数的商，一开始以为
2016-11-27 15:22:05
248
原创 377. Combination Sum IV
377 . Combination Sum IVDifficulty: Medium Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.
2016-11-25 00:50:00
235
原创 221. Maximal Square
221 . Maximal SquareDifficulty: Medium Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area. For example, given the following matr
2016-11-10 15:33:42
221
原创 40. Combination Sum II
40 . Combination Sum IIDifficulty: Medium Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each
2016-11-10 15:20:05
217
原创 322. Coin Change
322 . Coin ChangeDifficulty: Medium You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to ma
2016-10-27 15:49:29
245
原创 403. Frog Jump
403 . Frog JumpDifficulty: Hard A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not
2016-10-19 00:55:05
354
原创 395. Longest Substring with At Least K Repeating Characters
395 . Longest Substring with At Least K Repeating CharactersDifficulty: Medium Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every cha
2016-10-16 16:10:36
239
原创 201. Bitwise AND of Numbers Range
201 . Bitwise AND of Numbers RangeDifficulty: Medium Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. For example, given t
2016-10-15 15:59:12
214
原创 114. Flatten Binary Tree to Linked List
114 . Flatten Binary Tree to Linked ListDifficulty: Medium Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3 4 6 The flatte
2016-10-08 15:58:21
193
原创 72. Edit Distance
72 . Edit DistanceDifficulty: Hard Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the
2016-09-26 23:46:00
186
原创 49. Group Anagrams
49 . Group AnagramsDifficulty: Medium Given an array of strings, group anagrams together. For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Return: [ [“ate”, “eat”,”tea”
2016-09-21 11:43:01
284
原创 221. Maximal Square
221 . Maximal SquareDifficulty: Medium Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area. For example, given the following matr
2016-09-20 15:56:30
169
原创 228.Summary Ranges
228 .Summary RangesDifficulty: MediumGiven a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return [“0->2”,”4->5”,”7”].解题思路思路是比较清楚地，就是整出两个指向
2016-09-14 12:43:57
196
原创 113. Path Sum II
113.Path Sum IIDifficulty: Medium Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. For example: Given the below binary tree and sum = 22,
2016-09-10 22:09:23
258
原创 103.Binary Tree Zigzag Level Order Traversal
103.Binary Tree Zigzag Level Order TraversalDifficulty:medium Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the
2016-09-10 14:30:25
261
原创 120. Triangle
120. TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2]
2016-09-06 22:50:46
185
原创 328. Odd Even Linked List
328. Odd Even Linked List Medium难度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 th
2016-09-06 00:29:42
216
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人