leetcode -- 526. Beautiful Arrangement 【回溯 + 状态保存 + 状态还原】
来源:互联网 发布:大学入伍体检 知乎 编辑:程序博客网 时间:2024/06/05 07:48
Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by theseN numbers successfully if one of the following is true for the ith position (1 ≤ i ≤ N) in this array:
- The number at the ith position is divisible by i.
- i is divisible by the number at the ith position.
Now given N, how many beautiful arrangements can you construct?
Example 1:
Input: 2Output: 2Explanation: The first beautiful arrangement is [1, 2]:Number at the 1st position (i=1) is 1, and 1 is divisible by i (i=1).Number at the 2nd position (i=2) is 2, and 2 is divisible by i (i=2).The second beautiful arrangement is [2, 1]:Number at the 1st position (i=1) is 2, and 2 is divisible by i (i=1).Number at the 2nd position (i=2) is 1, and i (i=2) is divisible by 1.
Note:
- N is a positive integer and will not exceed 15.
解法1(回溯 + 状态保存浪费空间):
public class Solution {public int countArrangement(int N) {boolean[] invites = new boolean[N];return find(0,invites,N);}public int find(int pos,boolean[] invites,int N){if(pos == N) return 1;int sum = 0;for(int i =0;i < N;i++){if(!invites[i] && ((i+1) % (pos+1) == 0 || (pos+1) % (i+1) == 0)){boolean invites2[] = new boolean[N];System.arraycopy(invites, 0, invites2, 0, N); invites2[i] = true;sum += find(pos+1,invites2,N);}}return sum;}}
解法2(回溯 + 状态还原):
该方法节省了大量的空间,不用每次都新生成数组保存状态。
public class Solution {public static int countArrangement(int N) {boolean[] invites = new boolean[N];return find(0,invites,N);}public static int find(int pos,boolean[] invites,int N){if(pos == N) return 1;int sum = 0;for(int nums =0;nums < N;nums++){if(!invites[nums] && ((nums+1) % (pos+1) == 0 || (pos+1) % (nums+1) == 0)){invites[nums] = true;sum += find(pos+1,invites,N);invites[nums] = false; //状态还原}}return sum;}}
阅读全文
0 0
- leetcode -- 526. Beautiful Arrangement 【回溯 + 状态保存 + 状态还原】
- 【LeetCode】526. Beautiful Arrangement【M】【35】【回溯】
- 526. Beautiful Arrangement 回溯法
- LeetCode 526. Beautiful Arrangement
- 【Leetcode】526. Beautiful Arrangement
- [LeetCode]526. Beautiful Arrangement
- 【LeetCode】526. Beautiful Arrangement
- leetcode 526. Beautiful Arrangement
- Leetcode: 526. Beautiful Arrangement
- [LeetCode] 526. Beautiful Arrangement
- [LeetCode]526. Beautiful Arrangement
- [LeetCode] 526. Beautiful Arrangement
- LeetCode:526. Beautiful Arrangement
- [leetcode] 526. Beautiful Arrangement
- LeetCode笔记:526. Beautiful Arrangement
- [Leetcode] 526. Beautiful Arrangement 解题报告
- Leetcode Beautiful Arrangement
- Leetcode 526 Beautiful Arrangement
- C++(qt)游戏实战项目:坦克大战(五)
- Glide简单实用总结
- Struts2的的开发入门
- 《Head First设计模式》概述
- 查看库的安装版本和安装路径
- leetcode -- 526. Beautiful Arrangement 【回溯 + 状态保存 + 状态还原】
- 压缩与解压
- ajax
- bzoj 2321 星器
- 生产者/消费者模式(阻塞队列)
- 入职第一天
- MongoDB学习(二):数据类型和基本概念
- apt-get指令
- 用NDK在Ubuntu14.04上安装arm交叉编译环境