swift
柳婼
努力成为萌萌的程序媛~
展开
-
[swift] LeetCode 804. Unique Morse Code Words
International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a"maps to ".-", "b" maps to "-...", "c" maps to "-.-.", and so on.Fo原创 2018-08-29 12:21:28 · 376 阅读 · 0 评论 -
[swift] LeetCode 394. Decode String
Given an encoded string, return it’s decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is gua...原创 2018-08-28 10:42:57 · 315 阅读 · 0 评论 -
[swift] LeetCode 347. Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements.For example,Given [1,1,1,2,2,3] and k = 2, return [1,2].Note:You may assume k is always valid, 1 ≤ k ≤ number of unique ele...原创 2018-08-28 10:42:54 · 287 阅读 · 0 评论 -
[swift] LeetCode 338. Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example:For num = 5 you ...原创 2018-08-28 10:42:51 · 212 阅读 · 0 评论 -
[swift] 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 number, fi...原创 2018-08-28 10:42:48 · 176 阅读 · 0 评论 -
[swift] LeetCode 283. Move Zeroes
Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your fu...原创 2018-08-27 13:05:46 · 143 阅读 · 0 评论 -
[swift] LeetCode 238. Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n)...原创 2018-08-27 13:05:41 · 159 阅读 · 0 评论 -
[swift] LeetCode 234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?func isPalindrome(_ head: ListNode?) -> Bool { var arr = Array(repeating:...原创 2018-08-27 13:05:23 · 158 阅读 · 0 评论 -
[swift] LeetCode 215. Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Given [3,2,1,5,6,4] and k = 2, return 5.Not...原创 2018-08-27 13:05:19 · 252 阅读 · 0 评论 -
[swift] LeetCode 206. Reverse Linked List
Reverse a singly linked list.func reverseList(_ head: ListNode?) -> ListNode? { var stack = [Int](), p = head while let t = p { stack.append(t.val) p = t.next } p...原创 2018-08-27 13:05:15 · 214 阅读 · 0 评论 -
[swift] 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 house...原创 2018-08-27 13:05:06 · 167 阅读 · 0 评论 -
[swift] LeetCode 437. Path Sum III
You are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does not need to start or end at the root or a leaf, but it mus...原创 2018-08-28 10:43:01 · 214 阅读 · 0 评论 -
[swift] 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 large...原创 2018-08-28 10:43:04 · 233 阅读 · 0 评论 -
[swift] LeetCode 448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Coul...原创 2018-08-28 10:43:07 · 239 阅读 · 0 评论 -
[swift] LeetCode 709. To Lower Case
Implement function ToLowerCase() that has a string parameter str, and returns the same string in lowercase.Example 1: 1 2 Input: "Hello" Output: "hello" Example 2: ...原创 2018-08-29 12:21:23 · 278 阅读 · 0 评论 -
[swift] LeetCode 771. Jewels and Stones
You are given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the ston...原创 2018-08-29 12:21:20 · 263 阅读 · 0 评论 -
[swift] LeetCode 695. Max Area of Island
Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrou...原创 2018-08-29 12:21:09 · 211 阅读 · 0 评论 -
[swift] LeetCode 657. Judge Route Circle
Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.The move sequence is represented by...原创 2018-08-29 12:21:06 · 123 阅读 · 0 评论 -
[swift] LeetCode 617. Merge Two Binary Trees
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree...原创 2018-08-29 12:21:02 · 173 阅读 · 0 评论 -
[swift] LeetCode 581. Shortest Unsorted Continuous Subarray
Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.You need to find ...原创 2018-08-29 12:20:58 · 255 阅读 · 0 评论 -
[swift] LeetCode 572. Subtree of Another Tree
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node...原创 2018-08-29 12:20:55 · 221 阅读 · 0 评论 -
[swift] LeetCode 543. Diameter of Binary Tree
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may n...原创 2018-08-29 12:20:52 · 227 阅读 · 0 评论 -
[swift] LeetCode 538. Convert BST to Greater Tree
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.Exampl...原创 2018-08-28 10:43:16 · 147 阅读 · 0 评论 -
[swift] LeetCode 461. Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note:0 ≤ x, y < 2^3...原创 2018-08-28 10:43:11 · 229 阅读 · 0 评论 -
[swift] LeetCode 169. Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element alwa...原创 2018-08-27 13:05:02 · 155 阅读 · 0 评论 -
[swift] LeetCode 152. Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest prod...原创 2018-08-27 13:04:58 · 216 阅读 · 0 评论 -
[swift] LeetCode 62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bo...原创 2018-08-25 16:55:14 · 169 阅读 · 0 评论 -
[swift] LeetCode 49. Group Anagrams
Given an array of strings, group anagrams together.Example:Input: ["eat", "tea", "tan", "ate", "nat", "bat"],Output: [ [“ate”,”eat”,”tea”], [“nat”,”tan”], [“bat”] ]Note:All inputs will b原创 2018-08-25 16:54:05 · 185 阅读 · 0 评论 -
[swift] LeetCode 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....原创 2018-08-25 16:53:02 · 192 阅读 · 0 评论 -
[swift] LeetCode 23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.Example:Input: [ 1->4->5, 1->3->4, 2->6 ]Output: 1->1->2->3->4->...原创 2018-08-25 16:52:02 · 239 阅读 · 0 评论 -
[swift] 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.func mergeTwoLists(_ l1: ListNode?, _ l2: ListNode?) -&g...原创 2018-08-25 16:51:05 · 173 阅读 · 0 评论 -
[swift] LeetCode 20. Valid Parentheses
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()” and “()[]{}” are all valid bu...原创 2018-08-25 16:49:47 · 228 阅读 · 0 评论 -
【iOS10】使用XCode8、Swift3. 操作SQLite3数据库的步骤(包括配置环境和SQLite语句)
一、配置使用SQLite时的Swift框架工程环境步骤如下:1、点击项目名称 - Linked Frameworks and Libraries - “+” - 搜索“libsqlite3.dylib” - 然后点击Add【访问SQLite数据库需要使用SQLite官方提供的C语言风格的API,所以需要添加桥接文件】2、右击项目名称 - New File… - Header...原创 2016-12-03 19:16:25 · 4679 阅读 · 1 评论 -
【iOS】Swift3 报错:Value of type 'AppDelegate' has no member 'managedObjectContext',UIApplication has no
在Swift 3里面,需要通过viewContext访问managedObjectContext,且sharedApplication方法改为shared方法:var context = (UIApplication.shared.delegate as! AppDelegate).persistentContainer.viewContext以前是这样写的:var context = (UIAp原创 2016-11-19 17:21:04 · 5631 阅读 · 0 评论 -
【iOS开发】swift 3.0 延长设置launch image启动页面图片显示时间
在ViewController.swift里面的viewDidLoad方法中添加代码:override func viewDidLoad() { super.viewDidLoad() // Do any additional setup after loading the view, typically from a nib. Thre原创 2016-09-16 23:28:24 · 2012 阅读 · 0 评论 -
Swift代码规范
一行不要超过160个字符左大括号不换行运算符( + - * / == != ->)左右加空格,let myValue = 20 + (30 / 2) * 3逗号、冒号的后面加空格,但遇到后面是小括号则不需要加空格func insert(_ newElement: Element, atIndex i: Int) -> Int {}let myValue = [1, 2, 3,原创 2016-09-04 11:09:49 · 797 阅读 · 1 评论 -
[swift] LeetCode 70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?func climbStairs(_ n: Int) ->...原创 2018-08-25 16:57:06 · 200 阅读 · 0 评论 -
[swift] LeetCode 75. Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0,...原创 2018-08-25 17:03:59 · 154 阅读 · 0 评论 -
[swift] LeetCode 94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes’ values.For example:Given binary tree [1,null,2,3],1\2/3return [1,3,2].func inorderTraversal(_ root: TreeNode?) -> [Int] { va...原创 2018-08-25 17:05:29 · 212 阅读 · 0 评论 -
[swift] LeetCode 148. Sort List
Sort a linked list in O(n log n) time using constant space complexity.Example 1:Input: 4->2->1->3Output: 1->2->3->4Example 2:Input: -1->5->3->4->0Output: -1-...原创 2018-08-27 13:04:41 · 194 阅读 · 0 评论