算法入门2——开灯问题

题目描述：

　　There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it‘s off or turning off if it‘s on). For the ith round, you toggle every i bulb. For the nth round, you only toggle the last bulb. Find how many bulbs are on after n rounds.

leetcode地址：https://leetcode.com/problems/bulb-switcher/

练习代码：

int bulbSwitch(int n) {
        int res = 0;
        for(int i = 1; i*i <= n; i++ )
            res++;
        return res;
    }

算法入门2——开灯问题

原文：http://www.cnblogs.com/CindyZJT/p/5561593.html