算法
焦一正 Andy Jiao
这个作者很懒,什么都没留下…
展开
-
[Lintcode 136] Palindrome Partitioning
Description English Given a string s. Partition s such that every substring in the partition is a palindrome. Return all possible palindrome partitioning of s. Examples Example 1: Input: “a” Output: [...原创 2019-12-02 02:19:04 · 99 阅读 · 0 评论 -
Sorting
iterates through array swapping elements to find the smallest. def bubbleSort(arr): n = len(arr) for i in range(n): for j in range(0, n-i-1): if arr[j] > arr[j+1] : arr[j], arr[j+1] = arr[j+1], arr...原创 2019-08-29 15:18:28 · 105 阅读 · 0 评论