Discover
Communities
Decks
Login
Discover
Communities
Decks
Buy perks
Login
Signup
44
nbfuhao
Software Engineer, writing Swift and Objective codes
Available
Used
Resource Credits
4 Followers
0 Following
March 6, 2017
RSS feed
Posts
Blog
Posts
Comments
Communities
Wallet
Mute
nbfuhao
programming
8y
[LeetCode] Objective C — Reverse a NSString
[LeetCode: reverse a string] ( NSString* reverseString(NSString *originalString) { // use a new string to append the chars from the old one NSString *newString = @""; for (int i =
$ 0.000
35
3
nbfuhao
programming
8y
[LeetCode] Objective C — Check If a String Has Duplicate Characters
BOOL checkDuplicates(NSString *str) { NSMutableArray *storageArray = [NSMutableArray array]; for (int i = 0; i < str.length; i++) { NSString *charStr = [str substringWithRange:NSMakeRange(i,1)]; if
$ 0.000
33
nbfuhao
programming
8y
[LeetCode] Convert Sorted Array to Binary Search Tree in Objective C
LeetCode Convert Sorted Array to Binary Search Tree in Objective C typedef struct { int value; struct TreeNode *left; struct TreeNode *right; } TreeNode; -(TreeNode *)sortedArrayToBST:(NSArray *array)
$ 0.000
16
nbfuhao
programming
8y
[LeetCode] Validate Binary Search Tree in Objective C
LeetCode: Validate Binary Search Tree in Objective C typedef struct { int value; struct TreeNode *left; struct TreeNode *right; } TreeNode; -(BOOL)isValidBST:(TreeNode *)node { return (valid:node
$ 0.125
82
nbfuhao
programming
8y
[LeetCode] Balanced Binary Tree in Objective C
LeetCode: Balanced Binary Tree in Objective C typedef struct { int value; struct TreeNode *left; struct TreeNode *right; } TreeNode; - (BOOL)isBalanced:(TreeNode *)node { if (!node) return true; return
$ 0.214
90
nbfuhao
programming
8y
[LeetCode] Maximum Depth of Binary Tree in Objective C
LeetCode: Maximum Depth of Binary Tree in Objective C typedef struct { int value; struct TreeNode *left; struct TreeNode *right; } TreeNode; - (int)maximumDepth:(TreeNode *)node { if (!node) return 0;
$ 0.000
33
nbfuhao
leetcode
8y
[LeetCode] Binary Tree Level Order Traversal in Objective C
typedef struct { int value; struct TreeNode *left; struct TreeNode *right; } TreeNode; -(NSMutableArray *)levelOrder:(TreeNode *)treeNode { NSMutableArray *levelOrderArray = [NSMutableArray array]; if
$ 0.000
36
nbfuhao
objective
8y
[LeetCode] Binary Tree Preorder Traversal in Objective C
// typedef struct { // int value; // struct TreeNode *left; // struct TreeNode *right; // } TreeNode; -(NSMutableArray *)preorderTraversal:(TreeNode *)treeNode { NSMutableArray *preorderArray = [NSMutableArray
$ 0.000
36
Follow, be first to know
Nothing found in posts.
Center