iOS
You might find out that the private method of UIView recursiveDescription is useful, especially when you want to debug your view hierarchy. You could run the following command from the LLDB prompt in Xcode: po view.value(forKey: "recursiveDescription")! It would print the view hierarchy for you, all
iOS
There is an instance method of UIScrollView called setContentOffset(_:animated:). As UITableView is a subclass of UIScrollView, you could also use this method. If you need to scroll the table view to the top, you just call this method like below: tableView.setContentOffset(.zero, animated: true) Hope this helps, Michael
LeetCode
438. Find All Anagrams in a String Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,
LeetCode
102. Binary Tree Level Order Traversal LintCode-69.Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15
LeetCode
140. Word Break II Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. You may assume the dictionary does not contain duplicate words. Return all such possible sentences.
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], [2,1,1] ] public class Solution { public List<List<Integer>> permuteUnique(int[] nums) { List&
LeetCode
314. Binary Tree Vertical Order Traversal Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the same row and column, the order should be from left to right. Examples: 1. Given binary
Array
48. Rotate Image You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? public class Solution { public void rotate(int[][] matrix) { if (matrix == null) { return; } int n = matrix.length; for (int i = 0; i
Hash Table
36. Valid Sudoku Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character '.'. Note: A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to
Array
35. Search Insert Position Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array. Here are few examples. [1,3,5,
LeetCode
25. Reverse Nodes in k-Group Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is. You may not
LeetCode
15. 3Sum LintCode-57.3Sum Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets. For example, given
