2016年06月_frankstar123

原创 leetcode 357. Count Numbers with Unique Digits

题目内容Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.Example: Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x < 100, exc

2016-06-20 21:22:07 277

转载 TexturePacker非常棒的游戏资源图像处理工具

欢迎转载！转载时请注明出处：http://blog.csdn.net/aa4790139/article/details/8106993如果你还没接触到过这个工具，那你今天运气非常好了...下载地址：http://www.codeandweb.com/texturepacker说明：这款软件需要购买的，能够发一百多块买到这么好的工具还是挺值得，可以工具的价钱，肯定他带给的的

2016-06-16 15:40:35 640

转载常用纹理和纹理压缩格式

转载请注明出处: http://blog.csdn.net/ynnmnm/article/details/44983545 by 夜风简单纹理格式RGBA8888 每个像素4字节，RGBA通道各占用8位RGBA4444 每个像素2字节，RGBA通道各占用4位RGB888 每个像素3字节，RGB通道各占用8位，无透明通道RGB565 每个像素2字节，RGB通道各占

2016-06-15 20:42:47 790

原创 leetcode 287. Find the Duplicate Number

题目内容 Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate numbe

2016-06-15 20:22:00 275

原创 leetcode 213. House Robber II

题目内容 Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This tim

2016-06-15 19:48:38 302

转载各种移动GPU压缩纹理的使用方法

1. 移动GPU大全目前移动市场的GPU主要有四大厂商系列：1）Imagination Technologies的PowerVR SGX系列代表型号：PowerVR SGX 535、PowerVR SGX 540、PowerVR SGX 543MP、PowerVR SGX 554MP等代表作：Apple iPhone全系、iPad全系，三星I9000、P3100等

2016-06-15 11:15:53 787

原创关于OpenGL ES中的纹理压缩

基于OpenGL ES的压缩纹理有常见的如下几种实现： 1. ETC1（Ericcson texture compression) 2. PVRTC(PowerVR texture compression) 3. ATITC(ATI texture compression) 对于使用NVIDIA Tegra2芯片的手机如Motorola XOOM，ATRIX和DRIOID BIONIC则支持

2016-06-15 10:52:44 690

原创 leetcode 198. House Robber

题目内容You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent ho

2016-06-14 22:43:49 271

转载【科普文】深度学习：使用PowerVR实现计算机视觉

嵌入式视觉产品的市场需求量大，且呈不断发展壮大之势，其范围包括消费产品如手机、笔记本电脑、电视、可穿戴设备、汽车安全、安全与数据分析等。来自ABI、Gartner和TSR的最新数据表明，智能相机产品的总市场（TAM）量在2019年时将超过30亿台。计算机视觉的用户案例包括计算摄影、扩增实境、挥手感控及场景感知。当下，很多手机能通过人脸检测自动调整相机对焦和曝光，而像美图手机这样的产品还能实

2016-06-14 15:48:47 1776

原创 leetcode 345. Reverse Vowels of a String

题目内容 Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”. 题目分析翻转字符

2016-06-04 17:17:38 283

原创 leetcode 24. Swap Nodes in Pairs

题目内容 Given a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You

2016-06-04 16:26:46 255

原创 leetcode 88. Merge Sorted Array

题目内容 Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold addi

2016-06-04 15:43:48 260

原创 leetcode 21. 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 the nodes of the first two lists.题目分析将两个排序好的链表，归并成一个新排序好的链表。比较两个链表的最前端的值，然后比较加入新链表，

2016-06-03 22:17:13 269

原创 leetcode 342. Power of Four

题目内容 Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: Given num = 16, return true. Given num = 5, return false.Follow up: Could you solve it without l

2016-06-03 20:56:08 300

原创 leetcode 326. Power of Three

题目内容 Given an integer, write a function to determine if it is a power of three. 题目分析写一个函数判断这个数是不是3的冥。找出3的最大冥的的值，直接取mod就可以了。也就是说，这个方法适合所有的质数，其他数不行。。。。public class Solution { public boolean

2016-06-02 19:53:18 220

原创 leetcode 231. Power of Two

题目内容 Given an integer, write a function to determine if it is a power of two. 题目分析判断一个数是不是2的冥。只要对该数减一，然后&操作就可以了。例如 8=1000,8-1=0111,1000&0111=0；即可知道该数是不是2的冥了。public class Solution { public bo

2016-06-02 19:38:23 210

原创 leetcode 230. Kth Smallest Element in a BST

题目内容 Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST’s total elements.Follow up: What if the BST i

2016-06-02 11:31:57 214

原创 leetcode 96. Unique Binary Search Trees

题目内容 Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Given n = 3, there are a total of 5 unique BST’s.1 3 3 2 1\ /

2016-06-01 17:14:11 214

原创 leetcode 108. Convert Sorted Array to Binary Search Tree

题目内容 Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 题目分析给定一个排好序的数组，然后将其转换成最平衡的二叉查找树。根据二叉查找树的特点，左孩子都小于父节点，右孩子都大于父节点。所以，可以直接利用排序好的数组，取数组中间下标的值，不断作

2016-06-01 11:49:30 262

cfylove的专栏