Yvan Jiang的专栏

CS、CV、ML

Leetcode Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the ...

2015-07-31 10:06:24

阅读数 234

评论数 0

Leetcode Next Permutation

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not po...

2015-07-25 12:40:34

阅读数 206

评论数 0

Leetcode Delete Node in a Linked List

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 ...

2015-07-21 14:20:09

阅读数 229

评论数 0

面试题总结8

1、赋值表达式的逻辑返回值等于表达式的最终值。 m=1 if(m=1) cout 条件语句是成立的。

2015-07-20 15:34:17

阅读数 143

评论数 0

Leetcode Subsets

Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution ...

2015-07-17 10:13:20

阅读数 196

评论数 0

Leetcode Sum Root to Leaf Numbers

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->...

2015-07-15 16:58:03

阅读数 191

评论数 0

Leetcode Implement Queue using Stacks

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 fr...

2015-07-15 16:34:00

阅读数 234

评论数 0

Leetcode Implement Stack using Queues

Implement the following operations of a stack using queues. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack....

2015-07-13 17:21:42

阅读数 291

评论数 0

面试题总结7

Linux系统操作总结: 1、!!是什么操作? 执行上一次命令操作。 2、文件权限 文件权限分为四段表示,文件类型--拥有者权限--所在组权限--其他用户权限 文件类型有:d:文件夹,l:链接文件,b:里面可供存储周边设备,c:里面为一次性读取装置 权限:rwx,用二进制表示111 3、

2015-07-13 14:27:14

阅读数 239

评论数 0

MATLAB 复制文件

RPATH_SCALE1_IMG = 'F:\background\images'; RPATH_SCALE2_IMG = 'F:\background\sampleimage'; RPATH_SCALE3_IMG = 'F:\background\sampleimage3'; RPATH_SCA...

2015-07-12 18:16:25

阅读数 465

评论数 0

Leetcode Summary Ranges

Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return ["0->2",&...

2015-07-10 15:02:45

阅读数 210

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭